5316 search results - page 361 / 1064 » Which Search Problems Are Random |
186
click to vote
AVI
2008
15 years 9 months ago
2008
The desktop metaphor aimed to create a working environment, which would resemble that of the user's desk. With information abundance this desktop is often cluttered with file...
218
Voted
DCOSS
2011
Springer
14 years 7 months ago
2011
Springer
Abstract—We first present a problem called precedence constrained two traveling salesman (PC2TSP). We propose a nearoptimal heuristic to PC2TSP to generate tours by clustering p...
192
click to vote
IJCAI
2001
15 years 8 months ago
2001
Combinatorial auctions where bidders can bid on bundles of items can lead to more economical allocations, but determining the winners is NP-complete and inapproximable. We present...
192
click to vote
AAAI
2007
15 years 9 months ago
2007
We present a new probabilistic framework for finding likely variable assignments in difficult constraint satisfaction problems. Finding such assignments is key to efficient sea...
196
Voted
COR
2008
15 years 7 months ago
2008
In the past five years there has been a dramatic increase in work on Search Based Software Engineering (SBSE), an approach to software engineering in which search based optimisatio...