Sciweavers

14165 search results - page 689 / 2833
» The generalized two-server problem
Sort
View
194
Voted
PODS
2007
ACM
196views Database» more  PODS 2007»
16 years 7 months ago
On the complexity of managing probabilistic XML data
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...
Pierre Senellart, Serge Abiteboul
ICRA
2009
IEEE
112views Robotics» more  ICRA 2009»
16 years 2 months ago
Combining planning and motion planning
Abstract— Robotic manipulation is important for real, physical world applications. General Purpose manipulation with a robot (eg. delivering dishes, opening doors with a key, etc...
Jaesik Choi, Eyal Amir
201
Voted
COMPGEOM
2009
ACM
16 years 1 months ago
Minimum cuts and shortest homologous cycles
We describe the first algorithms to compute minimum cuts in surface-embedded graphs in near-linear time. Given an undirected graph embedded on an orientable surface of genus g, w...
Erin W. Chambers, Jeff Erickson, Amir Nayyeri
SIGECOM
2009
ACM
95views ECommerce» more  SIGECOM 2009»
16 years 1 months ago
Eliciting truthful answers to multiple-choice questions
Motivated by the prevalence of online questionnaires in electronic commerce, and of multiple-choice questions in such questionnaires, we consider the problem of eliciting truthful...
Nicolas S. Lambert, Yoav Shoham
GECCO
2007
Springer
160views Optimization» more  GECCO 2007»
16 years 1 months ago
Self-modifying cartesian genetic programming
In nature, systems with enormous numbers of components (i.e. cells) are evolved from a relatively small genotype. It has not yet been demonstrated that artificial evolution is su...
Simon Harding, Julian Francis Miller, Wolfgang Ban...