Sciweavers

1884 search results - page 115 / 377
» Simple Algorithm for Simple Timed Games
Sort
View
CORR
2011
Springer
158views Education» more  CORR 2011»
14 years 9 months ago
Nonuniform Coverage Control on the Line
Abstract— This paper investigates control laws allowing mobile, autonomous agents to optimally position themselves on the line for distributed sensing in a nonuniform field. We ...
Naomi Ehrich Leonard, Alexander Olshevsky
DAM
2011
14 years 9 months ago
Matchability and k-maximal matchings
We present a collection of new structural, algorithmic, and complexity results for two types of matching problems. The first problem involves the computation of k-maximal matchin...
Brian C. Dean, Sandra Mitchell Hedetniemi, Stephen...
ICALP
1994
Springer
15 years 6 months ago
Finding Even Cycles Even Faster
We describe efficient algorithms for finding even cycles in undirected graphs. Our main results are the following: (i) For every k 2, there is an O(V 2) time algorithm that decide...
Raphael Yuster, Uri Zwick
106
Voted
LMCS
2007
132views more  LMCS 2007»
15 years 2 months ago
The Complexity of Model Checking Higher-Order Fixpoint Logic
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
Roland Axelsson, Martin Lange, Rafal Somla
SIGECOM
2011
ACM
232views ECommerce» more  SIGECOM 2011»
14 years 5 months ago
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
Nikhil R. Devanur, Kamal Jain, Balasubramanian Siv...