Sciweavers

1242 search results - page 184 / 249
» The Theory of Grammar Constraints
Sort
View
129
Voted
ATAL
2008
Springer
15 years 2 months ago
No-regret learning and a mechanism for distributed multiagent planning
We develop a novel mechanism for coordinated, distributed multiagent planning. We consider problems stated as a collection of single-agent planning problems coupled by common soft...
Jan-P. Calliess, Geoffrey J. Gordon
EMSOFT
2011
Springer
14 years 13 days ago
Hard-real-time scheduling of data-dependent tasks in embedded streaming applications
Most of the hard-real-time scheduling theory for multiprocessor systems assumes independent periodic or sporadic tasks. Such a simple task model is not directly applicable to mode...
Mohamed Bamakhrama, Todor Stefanov
111
Voted
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
16 years 1 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi
91
Voted
TACAS
2009
Springer
109views Algorithms» more  TACAS 2009»
15 years 7 months ago
TaPAS: The Talence Presburger Arithmetic Suite
TAPAS is a suite of libraries dedicated to FO (R, Z, +, ≤). The suite provides (1) the application programming interface GENEPI for this logic with encapsulations of many classic...
Jérôme Leroux, Gérald Point
SIGMETRICS
2004
ACM
206views Hardware» more  SIGMETRICS 2004»
15 years 6 months ago
Performance aware tasking for environmentally powered sensor networks
The use of environmental energy is now emerging as a feasible energy source for embedded and wireless computing systems such as sensor networks where manual recharging or replacem...
Aman Kansal, Dunny Potter, Mani B. Srivastava