2661 search results - page 388 / 533 » Quantum Complexity Classes |
127
Voted
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
109
Voted
ICALP
2007
Springer
15 years 9 months ago
2007
Springer
Register allocation is NP-complete in general but can be solved in linear time for straight-line programs where each variable has at most one definition point if the bank of regis...
115
Voted
ICIC
2007
Springer
15 years 9 months ago
2007
Springer
Humans can easily recognize complex objects even if values of their attributes are imprecise and often inconsistent. It is not clear how the brain processes uncertain visual inform...
123
Voted
IPSN
2007
Springer
15 years 9 months ago
2007
Springer
Energy-efficient image communication is one of the most important goals for a large class of current and future sensor network applications. This paper presents a quantitative com...
135
click to vote
LFCS
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Balanced search trees provide guaranteed worst-case time performance and hence they form a very important class of data structures. However, the self-balancing ability co...