Sciweavers

674 search results - page 67 / 135
» Resource Bound Certification
Sort
View
119
Voted
KBSE
2007
IEEE
15 years 10 months ago
Sequential circuits for program analysis
A number of researchers have proposed the use of Boolean satisfiability solvers for verifying C programs. They encode correctness checks as Boolean formulas using finitization: ...
Fadi A. Zaraket, Adnan Aziz, Sarfraz Khurshid
IPPS
2000
IEEE
15 years 8 months ago
Self-Stabilizing Mutual Exclusion Using Unfair Distributed Scheduler
A self-stabilizing algorithm, regardless of the initial system state, converges in finite time to a set of states that satisfy a legitimacy predicate without the need for explici...
Ajoy Kumar Datta, Maria Gradinariu, Sébasti...
AIPS
2004
15 years 5 months ago
Iterative Relaxations for Iterative Flattening in Cumulative Scheduling
Cumulative scheduling is a generalization of jobshop scheduling, where machines have discrete capacities and activities may require several capacity units. This paper considers it...
Laurent Michel, Pascal Van Hentenryck
143
Voted
CORR
2008
Springer
124views Education» more  CORR 2008»
15 years 4 months ago
Scheduling Kalman Filters in Continuous Time
A set of N independent Gaussian linear time invariant systems is observed by M sensors whose task is to provide the best possible steady-state causal minimum mean square estimate o...
Jerome Le Ny, Eric Feron, Munther A. Dahleh
JMLR
2006
117views more  JMLR 2006»
15 years 3 months ago
On the Complexity of Learning Lexicographic Strategies
Fast and frugal heuristics are well studied models of bounded rationality. Psychological research has proposed the take-the-best heuristic as a successful strategy in decision mak...
Michael Schmitt, Laura Martignon