1431 search results - page 163 / 287 » The complexity of random ordered structures |
109
click to vote
CP
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. The heavy-tailed phenomenon that characterises the runtime distributions of backtrack search procedures has received considerable attention over the past few years. Some ...
119
click to vote
CONSTRAINTS
2006
15 years 3 months ago
2006
Abstract. The heavy-tailed phenomenon that characterises the runtime distributions of backtrack search procedures has received considerable attention over the past few years. Some ...
152
Voted
PPSN
2000
Springer
15 years 7 months 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...
141
Voted
GI
2009
Springer
15 years 7 months ago
2009
Springer
Abstract: Model-based development has an increasing importance in modern software engineering and other domains. Visual models such as Petri nets and UML diagrams proved to be an a...
182
Voted
AINA
2009
IEEE
15 years 10 months ago
2009
IEEE
—This paper deals with the traditional IP address lookup problem with fast updates. We propose a B-tree data structure, called MMSPT (Multiway Most Specific Prefix Tree), which i...