Sciweavers

1225 search results - page 82 / 245
» The Instance Complexity Conjecture
Sort
View
140
Voted
JACM
2010
120views more  JACM 2010»
14 years 9 months ago
The structure of inverses in schema mappings
A schema mapping is a specification that describes how data structured under one schema (the source schema) is to be transformed into data structured under a different schema (the...
Ronald Fagin, Alan Nash
193
Voted
ICDCS
2012
IEEE
13 years 5 months ago
Towards Optimal Capacity Segmentation with Hybrid Cloud Pricing
—Cloud resources are usually priced in multiple markets with different service guarantees. For example, Amazon EC2 prices virtual instances under three pricing schemes — the su...
Wei Wang, Baochun Li, Ben Liang
134
Voted
MOBICOM
2006
ACM
15 years 8 months ago
Cooperative collision warning using dedicated short range wireless communications
The emergence of the 802.11a-based Dedicated Short Range Communications (DSRC) standard and advances in mobile ad hoc networking create ample opportunity for supporting delay-crit...
Tamer A. ElBatt, Siddhartha K. Goel, Gavin Holland...
116
Voted
AMAI
2004
Springer
15 years 8 months ago
Warped Landscapes and Random Acts of SAT Solving
Recent dynamic local search (DLS) algorithms such as SAPS are amongst the state-of-the-art methods for solving the propositional satisfiability problem (SAT). DLS algorithms modi...
Dave A. D. Tompkins, Holger H. Hoos
126
Voted
ICALP
2010
Springer
15 years 7 months ago
On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
Venkatesan Guruswami, Rishi Saket