Sciweavers

3082 search results - page 512 / 617
» New Bounds for the Controller Problem
Sort
View
GECCO
2007
Springer
181views Optimization» more  GECCO 2007»
15 years 10 months ago
ACOhg: dealing with huge graphs
Ant Colony Optimization (ACO) has been successfully applied to those combinatorial optimization problems which can be translated into a graph exploration. Artificial ants build s...
Enrique Alba, J. Francisco Chicano
IJRR
2002
175views more  IJRR 2002»
15 years 4 months ago
Navigation Strategies for Exploring Indoor Environments
This paper investigates safe and efficient map-building strategies for a mobile robot with imperfect control and sensing. In the implementation, a robot equipped with a range sens...
Héctor H. González-Baños, Jea...
SIGMOD
2007
ACM
166views Database» more  SIGMOD 2007»
16 years 4 months ago
Threats to privacy in the forensic analysis of database systems
The use of any modern computer system leaves unintended traces of expired data and remnants of users' past activities. In this paper, we investigate the unintended persistenc...
Patrick Stahlberg, Gerome Miklau, Brian Neil Levin...
STACS
2010
Springer
15 years 11 months ago
Branching-time Model Checking of One-counter Processes
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...
Stefan Göller, Markus Lohrey
IPPS
2007
IEEE
15 years 10 months ago
A Semi-Distributed Axiomatic Game Theoretical Mechanism for Replicating Data Objects in Large Distributed Computing Systems
Replicating data objects onto servers across a system can alleviate access delays. The selection of data objects and servers requires solving a constraint optimization problem, wh...
Samee Ullah Khan, Ishfaq Ahmad