633 search results - page 53 / 127 » Locality and Hard SAT-Instances |
PODC
2000
ACM
14 years 2 months ago
2000
ACM
Distributed programs are hard to write. A distributed debugger equipped with the mechanism to re-execute the traced computation in a controlled fashion can greatly facilitate the ...
DDECS
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract-- Hard real-time systems need methods to determine upper bounds for their execution times, usually called worst-case execution times. Timing anomalies are counterintuitive...
DEXA
2006
Springer
14 years 1 months ago
2006
Springer
The composition of services that are indexed in a large-scale service directory often involves many complex queries issued by the service composition algorithm to the directory. Th...
ISSS
1995
IEEE
14 years 1 months ago
1995
IEEE
{DSP algorithms in most cases are subject to hard real-time constraints. In case of programmable DSP processors, meeting those constraints must be ensured by appropriate code gener...
AVBPA
2005
Springer
13 years 12 months ago
2005
Springer
There has been a flurry of works on video sequence-based face recognition in recent years. One of the hard problems in this area is how to effectively combine the facial configu...