Sciweavers

1278 search results - page 100 / 256
» Design and Analysis of Parametric Query Optimization Algorit...
Sort
View
MP
1998
109views more  MP 1998»
14 years 9 months ago
Rounding algorithms for covering problems
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
Dimitris Bertsimas, Rakesh V. Vohra
PODS
2002
ACM
168views Database» more  PODS 2002»
15 years 10 months ago
Conjunctive Selection Conditions in Main Memory
We consider the fundamental operation of applying a conjunction of selection conditions to a set of records. With large main memories available cheaply, systems may choose to keep...
Kenneth A. Ross
AAAI
2008
15 years 3 days ago
Reinforcement Learning for Vulnerability Assessment in Peer-to-Peer Networks
Proactive assessment of computer-network vulnerability to unknown future attacks is an important but unsolved computer security problem where AI techniques have significant impact...
Scott Dejmal, Alan Fern, Thinh Nguyen
IPSN
2009
Springer
15 years 4 months ago
Automating rendezvous and proxy selection in sensornets
As the diversity of sensornet use cases increases, the combinations of environments and applications that will coexist will make custom engineering increasingly impractical. We in...
David Chu, Joseph M. Hellerstein
ICNP
2005
IEEE
15 years 3 months ago
Exploiting Dynamic Querying like Flooding Techniques in Unstructured Peer-to-Peer Networks
In unstructured peer-to-peer networks, controlled flooding aims at locating an item at the minimum message cost. Dynamic querying is a new controlled flooding technique. While i...
Hongbo Jiang, Shudong Jin