Sciweavers

8413 search results - page 165 / 1683
» Ordering Problem Subgoals
Sort
View
ANOR
2007
58views more  ANOR 2007»
13 years 10 months ago
A fast swap-based local search procedure for location problems
We present a new implementation of a widely used swap-based local search procedure for the p-median problem, proposed in 1968 by Teitz and Bart. Our method produces the same outpu...
Mauricio G. C. Resende, Renato Fonseca F. Werneck
AAAI
2000
13 years 12 months ago
Acquiring Problem-Solving Knowledge from End Users: Putting Interdependency Models to the Test
Developing tools that allow non-programmers to enter knowledge has been an ongoing challenge for AI. In recent years researchers have investigated a variety ofpromising approaches...
Jihie Kim, Yolanda Gil
AAAI
1992
13 years 11 months ago
The Expected Value of Hierarchical Problem-Solving
est case using an abstraction hierarchy in problem-solving can yield an exponential speed-up in search e ciency. Such a speed-up is predicted by various analytical models develope...
Fahiem Bacchus, Qiang Yang
WEBI
2010
Springer
13 years 8 months ago
Reducing the Cold-Start Problem in Content Recommendation through Opinion Classification
Like search engines, recommender systems have become a tool that cannot be ignored by websites with a large selection of products, music, news or simply webpages links. The perform...
Damien Poirier, Françoise Fessant, Isabelle...
ICDE
2006
IEEE
108views Database» more  ICDE 2006»
14 years 12 months ago
On the Inverse Classification Problem and its Applications
In this paper, we discuss the inverse classification problem, in which we desire to define the features of an incomplete record in such a way that will result in a desired class l...
Charu C. Aggarwal, Chen Chen, Jiawei Han