## SEARCH

#### Country

##### ( see all 214)

- United States 5024 (%)
- Germany 3741 (%)
- China 3277 (%)
- United Kingdom 2408 (%)

#### Institution

##### ( see all 17324)

- Chinese Academy of Sciences 283 (%)
- University of California 254 (%)
- Tsinghua University 229 (%)
- Carnegie Mellon University 160 (%)
- National University of Singapore 155 (%)

#### Author

##### ( see all 72869)

- MacDonald, Matthew 132 (%)
- Kelly, James Floyd 99 (%)
- Mark, Dave 81 (%)
- Lischner, Ray 76 (%)
- Bauer, Friedrich L. 67 (%)

#### Subject

##### ( see all 255)

- Computer Science [x] 45416 (%)
- Artificial Intelligence (incl. Robotics) 13855 (%)
- Computer Communication Networks 12704 (%)
- Information Systems Applications (incl. Internet) 10270 (%)
- Information Storage and Retrieval 8750 (%)

## CURRENTLY DISPLAYING:

Most articles

Fewest articles

Showing 1 to 10 of 45416 matching Articles
Results per page:

## GeoCLEF 2008: The CLEF 2008 Cross-Language Geographic Information Retrieval Track Overview

### Evaluating Systems for Multilingual and Multimodal Information Access (2009-01-01) 5706: 808-821 , January 01, 2009

GeoCLEF is an evaluation task running under the scope of the Cross Language Evaluation Forum (CLEF). The purpose of GeoCLEF is to test and evaluate cross-language geographic information retrieval (GIR). The GeoCLEF 2008 task presented twenty-five geographically challenging search topics for English, German and Portuguese. Eleven participants submitted 131 runs, based on a variety of approaches, including sample documents, named entity extraction and ontology based retrieval. The evaluation methodology and results are presented in the paper.

## An Algorithm for Unrestored Flow Optimization in Survivable Networks Based on p-Cycles

### Computational Science – ICCS 2009 (2009-01-01) 5544: 315-324 , January 01, 2009

This paper provides compound algorithm for Unrestorable Flow Optimisation (UFO) problem formulated for computer networks protected by p-cycles, created on the base of mathematical model and solution approaches proposed in our complementary paper [1]. Components of the algorithm have been selected carefully and then experimentally tested in order to compose the best final algorithm. Results of the wide computer tests on common benchmarks have been also presented as well as some practical conclusions following from the research made.

## Classification with Unknown Classes

### Scientific and Statistical Database Management (2009-01-01) 5566: 479-496 , January 01, 2009

Given a data set D, such that (*X*_{i},*y*_{i}) ∈ *D*, *y*_{i} ∈ ℝ, we are interested in first dividing the range of *y*_{i}, i.e. (*y*_{max} − *y*_{min}), (where *y*_{max} is the maximum of all *y*_{i} corresponding to (*X*_{i},*y*_{i}) ∈ *D* and *y*_{min} is the minimum of all *y*_{i} corresponding to (*X*_{i},*y*_{i}) ∈ *D*), into contiguous ranges which can be thought of as classes and then for a new point, *X*_{j}, predicting which range (class) it falls into. The problem is difficult, because neither the size of each range nor the number of ranges, is known a-priori.

This was a practical problem that arose when we wanted to predict the execution time of a query in a database. For our purposes, an accurate prediction was not required, while a time range was sufficient and the time ranges were unknown a-priori.

To solve this problem we introduce a binary tree structure called *Class Discovery Tree*. We have used this technique successfully for predicting the execution times of a query and this is slated for incorporation into a commercial, enterprise level Database Management System.

In this paper, we discuss our solution and validate it on two more real life data sets. In the first one, we compare our result with a naive approach and in the second, with the published results. In both cases, our approach is superior.

## Numerical Study of Rayleigh-Benard Convection in a Rectangular Box

### Numerical Analysis and Its Applications (2009-01-01) 5434: 377-383 , January 01, 2009

Numerical study for convective instability of a liquid with linear vertical initial temperature profile in a closed box is presented. The paper provides stability analysis of two-dimensional rolls. Results are compared with R. Krishnamurti, F.H. Busse and coworkers data.

## Evolving Nash-optimal poker strategies using evolutionary computation

### Frontiers of Computer Science in China (2009-03-01) 3: 73-91 , March 01, 2009

This paper focuses on the development of a competitive computer player for the one versus one Texas Hold’em poker using evolutionary algorithms (EA). A Texas Hold’em game engine is first constructed where an efficient odds calculator is programmed to allow for the abstraction of a player’s cards, which yield important but complex information. Effort is directed to realize an optimal player that will play close to the Nash equilibrium (NE) by proposing a new fitness criterion. Preliminary studies on a simplified version of poker highlighted the intransitivity nature of poker. The evolved player displays strategies that are logical but reveals insights that are hard to comprehend e.g., bluffing. The player is then benchmarked against Poki and PSOpti, which is the best heads-up Texas Hold’em artificial intelligence to date and plays closest to the optimal Nash equilibrium. Despite the much constrained chromosomal strategy representation, simulated results verified that evolutionary algorithms are effective in creating strategies that are comparable to Poki and PSOpti in the absence of expert knowledge.

## Qualitative effects of knowledge rules and user feedback in probabilistic data integration

### The VLDB Journal (2009-07-21) 18: 1191-1217 , July 21, 2009

In data integration efforts, portal development in particular, much development time is devoted to entity resolution. Often advanced similarity measurement techniques are used to remove semantic duplicates or solve other semantic conflicts. It proves impossible, however, to automatically get rid of all semantic problems. An often-used rule of thumb states that about 90% of the development effort is devoted to semi-automatically resolving the remaining 10% hard cases. In an attempt to significantly decrease human effort at data integration time, we have proposed an approach that strives for a ‘good enough’ initial integration which stores any remaining semantic uncertainty and conflicts in a probabilistic database. The remaining cases are to be resolved with user feedback during query time. The main contribution of this paper is an experimental investigation of the effects and sensitivity of rule definition, threshold tuning, and user feedback on the integration quality. We claim that our approach indeed reduces development effort—and not merely shifts the effort—by showing that setting rough safe thresholds and defining only a few rules suffices to produce a ‘good enough’ initial integration that can be meaningfully used, and that user feedback is effective in gradually improving the integration quality.

## Discovering Relevant Cross-Graph Cliques in Dynamic Networks

### Foundations of Intelligent Systems (2009-01-01) 5722: 513-522 , January 01, 2009

Several algorithms, namely *CubeMiner*, *Trias*, and *Data-Peeler*, have been recently proposed to mine closed patterns in ternary relations. We consider here the specific context where a ternary relation denotes the value of a graph adjacency matrix at different timestamps. Then, we discuss the constraint-based extraction of patterns in such dynamic graphs. We formalize the concept of *δ*-contiguous closed 3-clique and we discuss the availability of a complete algorithm for mining them. It is based on a specialization of the enumeration strategy implemented in *Data-Peeler*. Indeed, clique relevancy can be specified by means of a conjunction of constraints which can be efficiently exploited. The added-value of our strategy is assessed on a real dataset about a public bicycle renting system. The raw data encode the relationships between the renting stations during one year. The extracted *δ*-contiguous closed 3-cliques are shown to be consistent with our domain knowledge on the considered city.

## Back Matter - Artificial Intelligence and Computational Intelligence

### Artificial Intelligence and Computational Intelligence (2009-01-01): 5855 , January 01, 2009

## Transaction Model

### Encyclopedia of Database Systems (2009-01-01) : 3157 , January 01, 2009

## Research on Case Retrieval of Case-Based Reasoning of Motorcycle Intelligent Design

### The Sixth International Symposium on Neural Networks (ISNN 2009) (2009-01-01) 56: 759-768 , January 01, 2009

The case retrieval model based on neural network is presented to enhance the efficiency and quality of retrieving case in the case-based reasoning system of the motorcycle intelligent design. In the retrieval model, the adaptive resonance theory neural network was used to dynamically cluster the cases in the case base to narrow the searching range. The back propagation neural network was applied to memory the index of cases to retrieve quickly the similar case from the narrowed case base. Thus the efficiency and quality of retrieving case are improved. Finally, an example of the plan selection of motorcycle general design was given. Its result was contrasted with that of case retrieval based on the nearest neighbor method to demonstrate the effectives of the case retrieval model. The research shows that it is practicable and effective using the adaptive resonance theory and BP neural network to modeling the reasoning mechanism.