336 search results - page 55 / 68 » Consultant-guided search algorithms for the quadratic assign... |
182
click to vote
CIKM
2007
Springer
16 years 24 days ago
2007
Springer
Several problems in text categorization are too hard to be solved by standard bag-of-words representations. Work in kernel-based learning has approached this problem by (i) consid...
153
click to vote
AAAI
1998
15 years 8 months ago
1998
A key assumption of all problem-solving approaches based on utility theory, including heuristic search, is that we can assign a utility or cost to each state. This in turn require...
173
click to vote
WWW
2007
ACM
16 years 7 months ago
2007
ACM
Finding relationships between entities on the Web, e.g., the connections between different places or the commonalities of people, is a novel and challenging problem. Existing Web ...
182
click to vote
ATAL
2009
Springer
16 years 1 months ago
2009
Springer
Distributed Lagrangian Relaxation Protocol (DisLRP) has been proposed to solve a distributed combinatorial maximization problem called the Generalized Mutual Assignment Problem (G...
162
click to vote
AI
1998
Springer
15 years 11 months ago
1998
Springer
Abstract. The general timetabling problem is an assignment of activities to xed time intervals, adhering to a prede ned set of resource availabilities. Timetabling problems are di ...