Sciweavers

1941 search results - page 355 / 389
» On the Hardness of Approximate Reasoning
Sort
View
PODS
2010
ACM
150views Database» more  PODS 2010»
15 years 4 months ago
Understanding queries in a search database system
It is well known that a search engine can significantly benefit from an auxiliary database, which can suggest interpretations of the search query by means of the involved concep...
Ronald Fagin, Benny Kimelfeld, Yunyao Li, Sriram R...
SPAA
2010
ACM
15 years 4 months ago
Securing every bit: authenticated broadcast in radio networks
This paper studies non-cryptographic authenticated broadcast in radio networks subject to malicious failures. We introduce two protocols that address this problem. The first, Nei...
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Zark...
SYSTOR
2010
ACM
15 years 4 months ago
On the DMA mapping problem in direct device assignment
I/O intensive workloads running in virtual machines can suffer massive performance degradation. Direct assignment of I/O devices to virtual machines is the best performing I/O vir...
Ben-Ami Yassour, Muli Ben-Yehuda, Orit Wasserman
GECCO
2010
Springer
191views Optimization» more  GECCO 2010»
15 years 4 months ago
Toward comparison-based adaptive operator selection
Adaptive Operator Selection (AOS) turns the impacts of the applications of variation operators into Operator Selection through a Credit Assignment mechanism. However, most Credit ...
Álvaro Fialho, Marc Schoenauer, Michè...
EICS
2009
ACM
15 years 4 months ago
StateStream: a developer-centric approach towards unifying interaction models and architecture
Complex and dynamic interaction behaviors in applications such as Virtual Reality (VR) systems are difficult to design and develop. Reasons for this include the complexity and lim...
Gerwin de Haan, Frits H. Post