64 search results - page 11 / 13 » New Dynamic Heuristics in the Client-Agent-Server Model |
IJCAI
2007
13 years 10 months ago
2007
Local search procedures for solving satisfiability problems have attracted considerable attention since the development of GSAT in 1992. However, recent work indicates that for m...
CASCON
1996
13 years 10 months ago
1996
This paper1 describes an algorithm for testing polymorphic interactions between classes in object-oriented (O-O) software. We propose an Augmented Object Relationship Diagram (AOR...
RTSS
1998
IEEE
14 years 25 days ago
1998
IEEE
Schedulability analysis of fixed priority preemptive scheduled systems can be performed by calculating the worst-case response-time of the involved processes. The system is deemed...
PPSN
2000
Springer
14 years 4 days ago
2000
Springer
Abstract. We explore a new general-purpose heuristic for nding highquality solutions to hard optimization problems. The method, called extremal optimization, is inspired by self-or...
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
I present MOSES (meta-optimizing semantic evolutionary search), a new probabilistic modeling (estimation of distribution) approach to program evolution. Distributions are not esti...