1629 search results - page 285 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
134
click to vote
TIP
2010
14 years 4 months ago
2010
The emergence of low-cost sensing architectures for diverse modalities has made it possible to deploy sensor networks that capture a single event from a large number of vantage po...
CORR
2011
Springer
14 years 1 months ago
2011
Springer
Efficient implementations of DPLL with the addition of clause learning are the fastest complete Boolean satisfiability solvers and can handle many significant real-world problem...
ICCS
2005
Springer
15 years 3 months ago
2005
Springer
The development of efficient parallel algorithms for large scale wildfire simulations is a challenging research problem because the factors that determine wildfire behavior are com...
SIROCCO
2008
14 years 11 months ago
2008
In the effort to understand the algorithmic limitations of computing by a swarm of robots, the research has focused on the minimal capabilities that allow a problem to be solved. ...
186
click to vote
ICDE
2004
IEEE
15 years 11 months ago
2004
IEEE
Twig queries represent the building blocks of declarative query languages over XML data. A twig query describes a complex traversal of the document graph and generates a set of el...