Sciweavers

14386 search results - page 2772 / 2878
» The Chinese Generals Problem
Sort
View
SIROCCO
2008
13 years 9 months ago
Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
In the effort to understand the algorithmic limitations of computing by a swarm of robots, the research has focused on the minimal capabilities that allow a problem to be solved. ...
Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nic...
SODA
2008
ACM
125views Algorithms» more  SODA 2008»
13 years 9 months ago
Ultra-low-dimensional embeddings for doubling metrics
We consider the problem of embedding a metric into low-dimensional Euclidean space. The classical theorems of Bourgain, and of Johnson and Lindenstrauss say that any metric on n p...
T.-H. Hubert Chan, Anupam Gupta, Kunal Talwar
SODA
2008
ACM
108views Algorithms» more  SODA 2008»
13 years 9 months ago
Price based protocols for fair resource allocation: convergence time analysis and extension to Leontief utilities
We analyze several distributed, continuous time protocols for a fair allocation of bandwidths to flows in a network (or resources to agents). Our protocols converge to an allocati...
Ashish Goel, Hamid Nazerzadeh
TREC
2008
13 years 9 months ago
TREC 2008 at the University at Buffalo: Legal and Blog Track
In the TREC 2008, the team from the State University of New York at Buffalo participated in the Legal track and the Blog track. For the Legal track, we worked on the interactive s...
Jianqiang Wang, Ying Sun, Omar Mukhtar, Rohini K. ...
SDL
2007
192views Hardware» more  SDL 2007»
13 years 9 months ago
OpenComRTOS: An Ultra-Small Network Centric Embedded RTOS Designed Using Formal Modeling
Abstract. OpenComRTOS is one of the few Real-Time Operating Systems (RTOS) for embedded systems that was developed using formal modeling techniques. The goal was to obtain a proven...
Eric Verhulst, Gjalt G. de Jong
« Prev « First page 2772 / 2878 Last » Next »