Sciweavers

911 search results - page 118 / 183
» Kolmogorov Complexity Cores
Sort
View
CEC
2007
IEEE
16 years 16 days ago
SAT-decoding in evolutionary algorithms for discrete constrained optimization problems
— For complex optimization problems, several population-based heuristics like Multi-Objective Evolutionary Algorithms have been developed. These algorithms are aiming to deliver ...
Martin Lukasiewycz, Michael Glaß, Christian ...
FOCS
2007
IEEE
16 years 16 days ago
Can you beat treewidth?
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...
Dániel Marx
ICDE
2007
IEEE
106views Database» more  ICDE 2007»
16 years 15 days ago
Mining Trajectory Databases via a Suite of Distance Operators
With the rapid progress of mobile devices and positioning technologies, Trajectory Databases (TD) have been in the core of database research during the last decade. Analysis and k...
Nikos Pelekis, Ioannis Kopanakis, Irene Ntoutsi, G...
IPPS
2007
IEEE
16 years 15 days ago
Memory Optimizations For Fast Power-Aware Sparse Computations
— We consider memory subsystem optimizations for improving the performance of sparse scientific computation while reducing the power consumed by the CPU and memory. We first co...
Konrad Malkowski, Padma Raghavan, Mary Jane Irwin
IPPS
2007
IEEE
16 years 15 days ago
Microarchitectural Support for Speculative Register Renaming
This paper proposes and evaluates a new microarchitecture for out-of-order processors that supports speculative renaming. We call speculative renaming to the speculative omission ...
Jesús Alastruey, Teresa Monreal, Víc...