Sciweavers

2200 search results - page 248 / 440
» Bloch's Constant is Computable
Sort
View
MFCS
2007
Springer
16 years 19 days ago
Well Supported Approximate Equilibria in Bimatrix Games: A Graph Theoretic Approach
Abstract. We study the existence and tractability of a notion of approximate equilibria in bimatrix games, called well supported approximate Nash Equilibria (SuppNE in short). We p...
Spyros C. Kontogiannis, Paul G. Spirakis
MFCS
2007
Springer
16 years 19 days ago
Communication in Networks with Random Dependent Faults
The aim of this paper is to study communication in networks where nodes fail in a random dependent way. In order to capture fault dependencies, we introduce the neighborhood fault...
Evangelos Kranakis, Michel Paquette, Andrzej Pelc
MOBICOM
2006
ACM
16 years 13 days ago
On the complexity of scheduling in wireless networks
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
Gaurav Sharma, Ravi R. Mazumdar, Ness B. Shroff
ICRA
2005
IEEE
145views Robotics» more  ICRA 2005»
16 years 2 days ago
Energy-Saving 3-Step Velocity Control Algorithm for Battery-Powered Wheeled Mobile Robots
— Energy of Wheeled Mobile Robot (WMR) is usually supplied by batteries with finite energy. In order to extend run-time of battery-powered WMR, it is necessary to minimize the e...
Chong Hui Kim, Byung Kook Kim
VSTTE
2005
Springer
15 years 12 months ago
From the How to the What
In this paper, we consider the Grand Challenge under a very specific perspective: the enabling of application experts without programming knowledge to reliably model their busines...
Tiziana Margaria, Bernhard Steffen