Sciweavers

451 search results - page 82 / 91
» Some Lower Bounds on Geometric Separability Problems
Sort
View
CORR
2002
Springer
166views Education» more  CORR 2002»
14 years 9 months ago
Quantum Time-Space Tradeoffs for Sorting
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
Hartmut Klauck
MACOM
2010
14 years 4 months ago
On the Performance of Single LDGM Codes for Iterative Data Fusion over the Multiple Access Channel
One of the applications of wireless sensor networks currently undergoing active research focuses on the scenario where the information generated by a data source S is simultaneousl...
Javier Del Ser, Javier Garcia-Frias, Pedro M. Cres...
JSS
2011
150views more  JSS 2011»
14 years 4 months ago
A novel general framework for automatic and cost-effective handling of recoverable temporal violations in scientific workflow sy
Due to the complex nature of scientific workflow environments, temporal violations often take place and may severely reduce the timeliness of the execution’s results. To handle ...
Xiao Liu, Zhiwei Ni, Zhangjun Wu, Dong Yuan, Jinju...
KR
2004
Springer
15 years 3 months ago
Planning Graphs and Knowledge Compilation
One of the major advances in classical planning has been the development of Graphplan. Graphplan builds a layered structure called the planning graph, and then searches this struc...
Hector Geffner
FOCS
1993
IEEE
15 years 1 months ago
An On-Line Algorithm for Improving Performance in Navigation
We consider the following scenario. A point robot is placed at some start location ¡ in a 2dimensional scene containing oriented rectangular obstacles. The robot must repeatedly ...
Avrim Blum, Prasad Chalasani