Sciweavers

1382 search results - page 158 / 277
» Formal Analysis of Online Algorithms
Sort
View
HYBRID
1997
Springer
15 years 10 months ago
Hybrid Systems with Finite Bisimulations
Abstract. The theory of formal verification is one of the main approaches to hybrid system analysis. Decidability questions for verification algorithms are obtained by constructi...
Gerardo Lafferriere, George J. Pappas, Shankar Sas...
VLSID
1994
IEEE
124views VLSI» more  VLSID 1994»
15 years 10 months ago
ILP-Based Scheduling with Time and Resource Constraints in High Level Synthesis
In this paper, we present a formal analysis of the constraints of the scheduling problem, and evaluate the structure of the scheduling polytope described by those constraints. Pol...
Samit Chaudhuri, Robert A. Walker
ECAI
2006
Springer
15 years 8 months ago
Strengthening Admissible Coalitions
We develop a criterion for coalition formation among goal-directed agents, the indecomposable do-ut-des property. The indecomposable do-ut-des property refines the do-ut-des proper...
Guido Boella, Luigi Sauro, Leendert W. N. van der ...
COCOON
2008
Springer
15 years 8 months ago
Average-Case Competitive Analyses for One-Way Trading
Consider a trader who exchanges one dollar into yen and assume that the exchange rate fluctuates within the interval [m, M]. The game ends without advance notice, then the trader ...
Hiroshi Fujiwara, Kazuo Iwama, Yoshiyuki Sekiguchi
ALGORITHMICA
2011
14 years 10 months ago
Average Rate Speed Scaling
Speed scaling is a power management technique that involves dynamically changing the speed of a processor. This gives rise to dual-objective scheduling problems, where the operati...
Nikhil Bansal, David P. Bunde, Ho-Leung Chan, Kirk...