2168 search results - page 343 / 434 » Randomized Algorithms and Complexity Theory |
116
click to vote
EDBT
2008
ACM
16 years 3 months ago
2008
ACM
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
130
click to vote
CCS
2006
ACM
15 years 6 months ago
2006
ACM
We introduce the notion of resiliency policies in the context of access control systems. Such policies require an access control system to be resilient to the absence of users. An...
149
click to vote
PPSN
2000
Springer
15 years 6 months ago
2000
Springer
Abstract. We explore a new general-purpose heuristic for nding highquality solutions to hard optimization problems. The method, called extremal optimization, is inspired by self-or...
130
Voted
SIAMCOMP
1998
15 years 2 months ago
1998
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
146
click to vote
IUI
2004
ACM
15 years 8 months ago
2004
ACM
In this paper, we describe a new approach to the creation of virtual environments, which uses qualitative physics to implement object behaviour. We adopted Qualitative Process The...