Sciweavers

3406 search results - page 208 / 682
» General Search Algorithms for Energy Minimization Problems
Sort
View
CP
2001
Springer
15 years 8 months ago
New Lower Bounds of Constraint Violations for Over-Constrained Problems
In recent years, many works have been carried out to solve over-constrained problems, and more speci cally the Maximal Constraint Satisfaction Problem (Max-CSP), where the goal is ...
Jean-Charles Régin, Thierry Petit, Christia...
GECCO
2005
Springer
232views Optimization» more  GECCO 2005»
15 years 9 months ago
Factorial representations to generate arbitrary search distributions
A powerful approach to search is to try to learn a distribution of good solutions (in particular of the dependencies between their variables) and use this distribution as a basis ...
Marc Toussaint
HIPC
2009
Springer
15 years 1 months ago
Highly scalable algorithm for distributed real-time text indexing
Stream computing research is moving from terascale to petascale levels. It aims to rapidly analyze data as it streams in from many sources and make decisions with high speed and a...
Ankur Narang, Vikas Agarwal, Monu Kedia, Vijay K. ...
CIAC
1994
Springer
148views Algorithms» more  CIAC 1994»
15 years 8 months ago
Efficient Reorganization of Binary Search Trees
We consider the problem of maintaining a binary search tree (BST) that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in whi...
Micha Hofri, Hadas Shachnai
DAC
2004
ACM
16 years 4 months ago
Profile-based optimal intra-task voltage scheduling for hard real-time applications
This paper presents a set of comprehensive techniques for the intratask voltage scheduling problem to reduce energy consumption in hard real-time tasks of embedded systems. Based ...
Jaewon Seo, Taewhan Kim, Ki-Seok Chung