Sciweavers

400 search results - page 71 / 80
» Lower Bounds Using Kolmogorov Complexity
Sort
View
SIAMCOMP
2002
112views more  SIAMCOMP 2002»
13 years 8 months ago
The Efficiency of Resolution and Davis--Putnam Procedures
We consider several problems related to the use of resolution-based methods for determining whether a given boolean formula in conjunctive normal form is satisfiable. First, build...
Paul Beame, Richard M. Karp, Toniann Pitassi, Mich...
CIC
2004
118views Communications» more  CIC 2004»
13 years 10 months ago
An Efficient Delay Sensitive Multicast Routing Algorithm
As a key issue in multicast routing with quality of service (QoS) support, constrained minimum Steiner tree (CMST) problem has been a research focus for more than a decade, and ten...
Gang Feng
PODS
2008
ACM
170views Database» more  PODS 2008»
14 years 8 months ago
Answering aggregate queries in data exchange
Data exchange, also known as data translation, has been extensively investigated in recent years. One main direction of research has focused on the semantics and the complexity of...
Foto N. Afrati, Phokion G. Kolaitis
GI
2009
Springer
13 years 6 months ago
Combined Optimization of Aircraft Maneuvers and RF Measurements for Passive Air-Air Ranging
: When a tactical aircraft sets out on a mission in dense airborne and surface RF (radio frequency) emitter environment, the pilot desires to minimize the use of the onboard fire c...
Ronald Matthew Yannone, Melvin Carroll
COCO
2004
Springer
185views Algorithms» more  COCO 2004»
14 years 14 days ago
Limitations of Quantum Advice and One-Way Communication
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...
Scott Aaronson