14779 search results - page 430 / 2956 » On Ultrametric Algorithmic Information |
181
click to vote
CP
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Machine learning can be utilized to build models that predict the runtime of search algorithms for hard combinatorial problems. Such empirical hardness models have previo...
166
click to vote
ISCC
2000
IEEE
15 years 10 months ago
2000
IEEE
In this paper we propose a novel late join algorithm for distributed applications with a fully replicated architecture (e.g. shared whiteboards). The term `late join algorithm'...
181
click to vote
RTCSA
1995
IEEE
15 years 10 months ago
1995
IEEE
In this paper, we present a joint scheduling of hard deadline periodic and soft deadline aperiodic tasks in dynamic-priority systems. The proposed algorithm has extended the fixed...
170
click to vote
ATVA
2008
Springer
15 years 9 months ago
2008
Springer
Multi-valued Model Checking is an extension of classical, two-valued model checking with multi-valued logic. Multi-valuedness has been proved useful in expressing additional inform...
164
click to vote
GECCO
2008
Springer
15 years 8 months ago
2008
Springer
Hierarchical menus are now ubiquitous. The performance of the menu depends on many factors: structure, layout, colors and so on. There has been extensive research on novel menus, ...