Sciweavers

2087 search results - page 355 / 418
» Computation of class numbers of quadratic number fields
Sort
View
ATAL
2010
Springer
14 years 11 months ago
Quasi deterministic POMDPs and DecPOMDPs
In this paper, we study a particular subclass of partially observable models, called quasi-deterministic partially observable Markov decision processes (QDET-POMDPs), characterize...
Camille Besse, Brahim Chaib-draa
CEC
2010
IEEE
14 years 11 months ago
Coordinate System Archive for coevolution
Problems in which some entities interact with each other are common in computational intelligence. This scenario, typical for co-evolving artificial-life agents, learning strategie...
Wojciech Jaskowski, Krzysztof Krawiec
DEXA
2010
Springer
213views Database» more  DEXA 2010»
14 years 11 months ago
Efficient K-Nearest Neighbor Search in Time-Dependent Spatial Networks
The class of k Nearest Neighbor (kNN) queries in spatial networks has been widely studied in the literature. All existing approaches for kNN search in spatial networks assume that ...
Ugur Demiryurek, Farnoush Banaei Kashani, Cyrus Sh...
ACTA
2007
92views more  ACTA 2007»
14 years 10 months ago
Solving #SAT using vertex covers
Abstract We propose an exact algorithm for counting the models of propositional formulas in conjunctive normal form (CNF). Our algorithm is based on the detection of strong backdoo...
Naomi Nishimura, Prabhakar Ragde, Stefan Szeider
ALGORITHMICA
2006
138views more  ALGORITHMICA 2006»
14 years 10 months ago
Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult
We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as subgraphs. We perform a detail...
Hajo Broersma, Fedor V. Fomin, Jan Kratochví...