Sciweavers

3637 search results - page 319 / 728
» On Dynamic Bit-Probe Complexity
Sort
View
STOC
2010
ACM
193views Algorithms» more  STOC 2010»
15 years 11 months ago
Maintaining a large matching and a small vertex cover
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
Krzysztof Onak, Ronitt Rubinfeld
CP
2000
Springer
15 years 11 months ago
Constraint-Based Agents: The ABC's of CBA's
The Constraint-Based Agent (CBA) framework is a set of tools for designing, simulating, building, verifying, optimizing, learning and debugging controllers for agents embedded in a...
Alan K. Mackworth
IPPS
1999
IEEE
15 years 11 months ago
An Object-Oriented Environment for Sparse Parallel Computation on Adaptive Grids
Many numerical solutions of large scale simulation models require finer discretizations in some regions of the computational grid. When this region is not known in advance, adapti...
Salvatore Filippone, Michele Colajanni, Dario Pasc...
KBSE
1999
IEEE
15 years 11 months ago
Towards Adaptive Web Agents
There is an increasingly large demand for software systems which are able to operate effectively in dynamic environments. In such environments, automated software engineering is e...
J. William Murdock, Ashok K. Goel
HICSS
1998
IEEE
128views Biometrics» more  HICSS 1998»
15 years 11 months ago
A Situation Calculus Model of Hypertext
We utilize the situation calculus to develop a logical model of hypertext systems. The work builds upon the earlier work of Bieber and Kimbrough in the logical modeling of hyperte...
Richard B. Scherl, Michael Bieber, Fabio Vitali