1197 search results - page 193 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
HPDC
2002
IEEE
14 years 1 months ago
2002
IEEE
One approach to high-performance processing of massive data sets is to incorporate computation into storage systems. Previous work has shown that this active storage model is effe...
VLDB
2002
ACM
13 years 7 months ago
2002
ACM
Extensibility is one of the mayor benefits of object-relational database management systems. We have used this system property to implement a StateMachine Module inside an object-...
WINET
2010
13 years 6 months ago
2010
Abstract In this work we study the combination of multicost routing and adjustable transmission power in wireless ad hoc networks, so as to obtain dynamic energy- and interference-...
COREGRID
2007
Springer
14 years 2 months ago
2007
Springer
We investigate the problem of atomic commit in transactional database systems built on top of Distributed Hash Tables. Therefore we present a framework for DHTs to provide strong d...
ICALP
2010
Springer
14 years 26 days ago
2010
Springer
Abstract. We study the “subgraph connectivity” problem for undirected graphs with sublinear vertex update time. In this problem, we can make vertices active or inactive in a gr...