2412 search results - page 361 / 483 » Which Problems Have Strongly Exponential Complexity |
COMPGEOM
2009
ACM
14 years 2 months ago
2009
ACM
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...
SIGECOM
2009
ACM
14 years 2 months ago
2009
ACM
The literature on algorithmic mechanism design is mostly concerned with game-theoretic versions of optimization problems to which standard economic money-based mechanisms cannot b...
HICSS
2008
IEEE
14 years 2 months ago
2008
IEEE
Research has shown that decentralized networks and organizations perform better and have more satisfied members than centralized ones. Further, decentralized self-organizing netwo...
ICRA
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract— We have recently proposed DSLX, a motion planner that significantly reduces the computational time for solving challenging kinodynamic problems by interleaving continu...
IPPS
2007
IEEE
14 years 2 months ago
2007
IEEE
Driven by the increasing componentization of scientific codes, the deployment of high-end system infrastructures such as the Grid, and the desire to support high level problem so...