Sciweavers

5372 search results - page 74 / 1075
» complexity 2007
Sort
View
ITA
2007
13 years 7 months ago
Three notes on the complexity of model checking fixpoint logic with chop
Abstract. This paper analyses the complexity of model checking Fixpoint Logic with Chop – an extension of the modal µ-calculus with a sequential composition operator. It uses tw...
Martin Lange
INFOCOM
2007
IEEE
14 years 2 months ago
Low-Complexity Distributed Scheduling Algorithms for Wireless Networks
— We consider the problem of distributed scheduling in wireless networks. We present two different algorithms whose performance is arbitrarily close to that of maximal schedules,...
Abhinav Gupta, Xiaojun Lin, R. Srikant
GECCO
2007
Springer
138views Optimization» more  GECCO 2007»
14 years 1 months ago
Reducing the space-time complexity of the CMA-ES
A limited memory version of the covariance matrix adaptation evolution strategy (CMA-ES) is presented. This algorithm, L-CMA-ES, improves the space and time complexity of the CMA-...
James N. Knight, Monte Lunacek
WDAG
2007
Springer
97views Algorithms» more  WDAG 2007»
14 years 1 months ago
On the Message Complexity of Indulgent Consensus
Many recommend planning for the worst and hoping for the best. In this paper we devise efficient indulgent consensus algorithms that can tolerate crash failures and arbitrarily lo...
Seth Gilbert, Rachid Guerraoui, Dariusz R. Kowalsk...
MCU
2004
59views Hardware» more  MCU 2004»
13 years 9 months ago
On the Complexity of Universal Programs
Abstract. This paper provides a framework enabling to define and determine the complexity of various universal programs U for various machines. The approach consists of first defin...
Alain Colmerauer