Sciweavers

3758 search results - page 297 / 752
» A Complete Subsumption Algorithm
Sort
View
SAINT
2005
IEEE
16 years 5 days ago
Fault-Tolerant Routing for P2P Systems with Unstructured Topology
New application scenarios, such as Internet-scale computations, nomadic networks and mobile systems, require decentralized, scalable and open infrastructures. The peerto-peer (P2P...
Leonardo Mariani
APPROX
2005
Springer
105views Algorithms» more  APPROX 2005»
16 years 5 days ago
The Complexity of Making Unique Choices: Approximating 1-in- k SAT
We study the approximability of 1-in-kSAT, the variant of Max kSAT where a clause is deemed satisfied when precisely one of its literals is satisfied. We also investigate differ...
Venkatesan Guruswami, Luca Trevisan
ATAL
2005
Springer
16 years 5 days ago
Coordinated exploration of unknown labyrinthine environments applied to the pursuit evasion problem
This paper introduces a multi-robot cooperation approach to solve the pursuit evasion problem for mobile robots that have omnidirectional vision sensors in unknown environments. T...
Damien Pellier, Humbert Fiorino
ISAAC
2005
Springer
86views Algorithms» more  ISAAC 2005»
16 years 3 days ago
On the Computation of Colored Domino Tilings of Simple and Non-simple Orthogonal Polygons
We explore the complexity of computing tilings of orthogonal polygons using colored dominoes. A colored domino is a rotatable 2 × 1 rectangle that is partitioned into two unit squ...
Chris Worman, Boting Yang
SEMWEB
2005
Springer
16 years 2 days ago
Containment and Minimization of RDF/S Query Patterns
Semantic query optimization (SQO) has been proved to be quite useful in various applications (e.g., data integration, graphical query generators, caching, etc.) and has been extens...
Giorgos Serfiotis, Ioanna Koffina, Vassilis Christ...