Sciweavers

3406 search results - page 405 / 682
» General Search Algorithms for Energy Minimization Problems
Sort
View
CP
2001
Springer
15 years 11 months ago
Solving Non-binary CSPs Using the Hidden Variable Encoding
Non-binary constraint satisfaction problems (CSPs) can be solved in two different ways. We can either translate the problem into an equivalent binary one and solve it using well-e...
Nikos Mamoulis, Kostas Stergiou
GECCO
2005
Springer
146views Optimization» more  GECCO 2005»
16 years 3 days ago
An empirical study of the robustness of two module clustering fitness functions
Two of the attractions of search-based software engineering (SBSE) derive from the nature of the fitness functions used to guide the search. These have proved to be highly robust...
Mark Harman, Stephen Swift, Kiarash Mahdavi
IMECS
2007
15 years 8 months ago
A Common Subexpression Sharing Approach for Multiplierless Synthesis of Multiple Constant Multiplications
—In the context of multiple constant multiplications (MCM) design, we propose a novel common-subexpression-elimination (CSE) algorithm that models synthesis of coefficients into ...
Yuen-Hong Alvin Ho, Chi-Un Lei, Ngai Wong
WSDM
2010
ACM
211views Data Mining» more  WSDM 2010»
15 years 11 months ago
IntervalRank - Isotonic Regression with Listwise and Pairwise Constraints
Ranking a set of retrieved documents according to their relevance to a given query has become a popular problem at the intersection of web search, machine learning, and informatio...
Taesup Moon, Alex Smola, Yi Chang, Zhaohui Zheng
APPROX
2006
Springer
162views Algorithms» more  APPROX 2006»
15 years 10 months ago
Approximating Precedence-Constrained Single Machine Scheduling by Coloring
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
Christoph Ambühl, Monaldo Mastrolilli, Ola Sv...