955 search results - page 157 / 191 » A System for Solving Constraint Satisfaction Problems with S... |
FOCS
2007
IEEE
14 years 2 months ago
2007
IEEE
: We study the computational strength of quantum particles (each of finite dimensionality) arranged on a line. First, we prove that it is possible to perform universal adiabatic q...
DNA
2006
Springer
13 years 12 months ago
2006
Springer
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...
ICRA
2002
IEEE
14 years 1 months ago
2002
IEEE
:This paper presents a trajectory planning algorithm for mobile robots which may be subject to kinodynamic constraints. Using computational methods from noncommutative harmonic ana...
PODS
2006
ACM
14 years 8 months ago
2006
ACM
Data exchange deals with inserting data from one database into another database having a different schema. We study and solve a central computational problem of data exchange, nam...
DGO
2007
13 years 9 months ago
2007
Solving complex global problems such as illegal immigration, border control, and terrorism requires government organizations at all levels to share not only data but, more importa...