Sciweavers

4451 search results - page 550 / 891
» On Random Ordering Constraints
Sort
View
CSCLP
2005
Springer
16 years 7 days ago
Complexity Analysis of Heuristic CSP Search Algorithms
CSP search algorithms are exponential in the worst-case. A trivial upper bound on the time complexity of CSP search algorithms is O∗ (dn ), where n and d are the number of variab...
Igor Razgon
EMSOFT
2005
Springer
16 years 7 days ago
A GA-based scheduling method for FlexRay systems
An advanced communication system, the FlexRay system, has been developed for future automotive applications. It consists of time-triggered clusters, such as drive-by-wire in cars,...
Shan Ding, Naohiko Murakami, Hiroyuki Tomiyama, Hi...
FROCOS
2005
Springer
16 years 7 days ago
A Comprehensive Framework for Combined Decision Procedures
We define a general notion of a fragment within higher order type theory; a procedure for constraint satisfiability in combined fragments is outlined, following Nelson-Oppen sche...
Silvio Ghilardi, Enrica Nicolini, Daniele Zucchell...
GECCO
2005
Springer
126views Optimization» more  GECCO 2005»
16 years 7 days ago
Evolutionary computation methods for synchronization of effects based operations
Effects based operations (EBO) is a concept based on the premise that a desired strategic outcome can be achieved through synergistic, multiplicative, and cumulative application ...
Jeffrey P. Ridder
HPCC
2005
Springer
16 years 7 days ago
Self-optimizing MPI Applications: A Simulation-Based Approach
Historically, high performance systems use schedulers and intelligent resource managers in order to optimize system usage and application performance. Most of the times, applicatio...
Emilio Mancini, Massimiliano Rak, Roberto Torella,...