1012 search results - page 122 / 203 » Segment intersection searching problems in general settings |
CP
2006
Springer
15 years 3 months ago
2006
Springer
ion of a given partial assignment of values to variables. Compared with other symmetry breaking techniques, the big advantage of dynamic symmetry breaking is that it can accommodat...
FOCS
2007
IEEE
15 years 6 months ago
2007
IEEE
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
110
click to vote
TALG
2010
14 years 6 months ago
2010
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
WWW
2009
ACM
16 years 16 days ago
2009
ACM
Understanding the intent behind a user's query can help search engine to automatically route the query to some corresponding vertical search engines to obtain particularly re...
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
This paper introduces the concept of a critical backbone as a minimal set of variables or part of the solution necessary to be within the basin of attraction of the global optimum...