16666 search results - page 2811 / 3334 » Descriptive and Computational Complexity |
203
click to vote
GECCO
2007
Springer
16 years 1 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...
155
click to vote
ICALP
2007
Springer
16 years 1 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...
196
click to vote
ICB
2007
Springer
16 years 1 months ago
2007
Springer
There are increasing requirements for mobile personal identification, e.g. to protect identity theft in wireless applications. Based on built-in cameras of mobile devices, palmprin...
181
click to vote
ICDT
2007
ACM
16 years 1 months ago
2007
ACM
Abstract. In many cases, users may want to consider incomplete answers to their queries. Often, however, there is an overwhelming number of such answers, even if subsumed answers a...
176
click to vote
ICIC
2007
Springer
16 years 1 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...