Sciweavers

2089 search results - page 209 / 418
» A New Problem in String Searching
Sort
View
EVOW
2005
Springer
15 years 8 months ago
Population Training Heuristics
This work describes a new way of employing problem-specific heuristics to improve evolutionary algorithms: the Population Training Heuristic (PTH). The PTH employs heuristics in ...
Alexandre César Muniz de Oliveira, Luiz Ant...
SODA
2010
ACM
216views Algorithms» more  SODA 2010»
16 years 15 days ago
On linear and semidefinite programming relaxations for hypergraph matching
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
Yuk Hei Chan, Lap Chi Lau
ICDE
2008
IEEE
110views Database» more  ICDE 2008»
16 years 4 months ago
Standing Out in a Crowd: Selecting Attributes for Maximum Visibility
In recent years, there has been significant interest in development of ranking functions and efficient top-k retrieval algorithms to help users in ad-hoc search and retrieval in da...
Muhammed Miah, Gautam Das, Vagelis Hristidis, Heik...
CPAIOR
2004
Springer
15 years 8 months ago
Super Solutions in Constraint Programming
To improve solution robustness, we introduce the concept of super solutions to constraint programming. An (a, b)-super solution is one in which if a variables lose their values, th...
Emmanuel Hebrard, Brahim Hnich, Toby Walsh
AAAI
2007
15 years 5 months ago
Using Expectation Maximization to Find Likely Assignments for Solving CSP's
We present a new probabilistic framework for finding likely variable assignments in difficult constraint satisfaction problems. Finding such assignments is key to efficient sea...
Eric I. Hsu, Matthew Kitching, Fahiem Bacchus, She...