Sciweavers

1450 search results - page 184 / 290
» On the Complexity of Hardness Amplification
Sort
View
MOBIHOC
2002
ACM
14 years 9 months ago
Message-optimal connected dominating sets in mobile ad hoc networks
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
Khaled M. Alzoubi, Peng-Jun Wan, Ophir Frieder
GECCO
2009
Springer
151views Optimization» more  GECCO 2009»
14 years 4 months ago
Evolution of functional specialization in a morphologically homogeneous robot
A central tenet of embodied artificial intelligence is that intelligent behavior arises out of the coupled dynamics between an agent’s body, brain and environment. It follows t...
Joshua S. Auerbach, Josh C. Bongard
INFOCOM
2005
IEEE
14 years 3 months ago
Practical algorithms for performance guarantees in buffered crossbars
— This paper is about high capacity switches and routers that give guaranteed throughput, rate and delay guarantees. Many routers are built using input queueing or combined input...
Shang-Tse Chuang, Sundar Iyer, Nick McKeown
PODS
2010
ACM
242views Database» more  PODS 2010»
14 years 2 months ago
Certain answers for XML queries
The notion of certain answers arises when one queries incompletely specified databases, e.g., in data integration and exchange scenarios, or databases with missing information. W...
Claire David, Leonid Libkin, Filip Murlak
EICS
2009
ACM
14 years 2 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