1705 search results - page 239 / 341 » Representing Constraints with Automata |
210
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
Social laws have proved to be a powerful and theoretically elegant framework for coordination in multi-agent systems. Most existing models of social laws assume that a designer is...
183
click to vote
EMSOFT
2011
Springer
14 years 6 months ago
2011
Springer
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...
172
click to vote
ICIP
2008
IEEE
16 years 8 months ago
2008
IEEE
The allowable computational complexity of video encoding is limited in a power-constrained system. Different video frames are associated with different motions and contexts, and s...
166
click to vote
PPOPP
2009
ACM
16 years 7 months ago
2009
ACM
Researchers in transactional memory (TM) have proposed open nesting as a methodology for increasing the concurrency of transactional programs. The idea is to ignore "low-leve...
148
click to vote
SAS
2009
Springer
16 years 7 months ago
2009
Springer
Polyhedra: An Abstract Domain to Infer Interval Linear Relationships Liqian Chen1,2 , Antoine Min?e2,3 , Ji Wang1 , and Patrick Cousot2,4 1 National Laboratory for Parallel and Dis...