Sciweavers

60 search results - page 9 / 12
» On the Power of Unambiguity in Alternating Machines
Sort
View
IROS
2007
IEEE
108views Robotics» more  IROS 2007»
14 years 1 months ago
Hiding the acoustic signature of a mobile robot
—A mobile robot can be a rather significant source of noise: noisy fans cool onboard computers, motors are spinning, rubber wheels are squeaking against the floor, and mechanical...
Eric Martinson
DSN
2005
IEEE
14 years 1 months ago
Detecting Stealth Software with Strider GhostBuster
Stealth malware programs that silently infect enterprise and consumer machines are becoming a major threat to the future of the Internet [XZ04]. Resource hiding is a powerful stea...
Yi-Min Wang, Doug Beck, Binh Vo, Roussi Roussev, C...
GECCO
2005
Springer
232views Optimization» more  GECCO 2005»
14 years 27 days ago
Factorial representations to generate arbitrary search distributions
A powerful approach to search is to try to learn a distribution of good solutions (in particular of the dependencies between their variables) and use this distribution as a basis ...
Marc Toussaint
EUROMICRO
1998
IEEE
13 years 11 months ago
SMP PCs: A Case Study on Cluster Computing
As commodity microprocessors and networks reach performance levels comparable to those used in massively parallel processors, clusters of symmetric multiprocessors are starting to...
Antônio Augusto Fröhlich, Wolfgang Schr...
CIAC
2010
Springer
259views Algorithms» more  CIAC 2010»
13 years 11 months ago
On Strategy Improvement Algorithms for Simple Stochastic Games
The study of simple stochastic games (SSGs) was initiated by Condon for analyzing the computational power of randomized space-bounded alternating Turing machines. The game is play...
Rahul Tripathi, Elena Valkanova, V. S. Anil Kumar