Sciweavers

15073 search results - page 2856 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
111
Voted
CARDIS
2008
Springer
153views Hardware» more  CARDIS 2008»
15 years 3 months ago
Ultra-Lightweight Implementations for Smart Devices - Security for 1000 Gate Equivalents
In recent years more and more security sensitive applications use passive smart devices such as contactless smart cards and RFID tags. Cost constraints imply a small hardware footp...
Carsten Rolfes, Axel Poschmann, Gregor Leander, Ch...
ESA
2008
Springer
148views Algorithms» more  ESA 2008»
15 years 3 months ago
Selfish Bin Packing
Following recent interest in the study of computer science problems in a game theoretic setting, we consider the well known bin packing problem where the items are controlled by se...
Leah Epstein, Elena Kleiman
IJCAI
2007
15 years 3 months ago
Color Learning on a Mobile Robot: Towards Full Autonomy under Changing Illumination
A central goal of robotics and AI is to be able to deploy an agent to act autonomously in the real world over an extended period of time. It is commonly asserted that in order to ...
Mohan Sridharan, Peter Stone
SIROCCO
2008
15 years 3 months ago
Recovering the Long-Range Links in Augmented Graphs
The augmented graph model, as introduced by Kleinberg (STOC 2000), is an appealing model for analyzing navigability in social networks. Informally, this model is defined by a pair...
Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker
SODA
2008
ACM
105views Algorithms» more  SODA 2008»
15 years 3 months ago
Deterministic random walks on regular trees
Jim Propp's rotor router model is a deterministic analogue of a random walk on a graph. Instead of distributing chips randomly, each vertex serves its neighbors in a fixed or...
Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich...
« Prev « First page 2856 / 3015 Last » Next »