Sciweavers

1480 search results - page 248 / 296
» Ants can solve constraint satisfaction problems
Sort
View
EAAI
2008
75views more  EAAI 2008»
13 years 11 months ago
Enacting agent-based services for automated procurement
Negotiation events in industrial procurement involving multiple, highly customisable goods pose serious challenges to buying agents when trying to determine the best set of provid...
Andrea Giovannucci, Juan A. Rodríguez-Aguil...
CORR
2011
Springer
245views Education» more  CORR 2011»
13 years 6 months ago
A linear framework for region-based image segmentation and inpainting involving curvature penalization
Abstract We present the first method to handle curvature regularity in region-based image segmentation and inpainting that is independent of initialization. To this end we start f...
Thomas Schoenemann, Fredrik Kahl, Simon Masnou, Da...
GRAPHICSINTERFACE
2011
13 years 2 months ago
Edge-constrained image compositing
The classic task of image compositing is complicated by the fact that the source and target images need to be carefully aligned and adjusted. Otherwise, it is not possible to achi...
Martin Eisemann, Daniel Gohlke, Marcus A. Magnor
CORR
2008
Springer
95views Education» more  CORR 2008»
13 years 11 months ago
Explicit Learning: an Effort towards Human Scheduling Algorithms
Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approach...
Jingpeng Li, Uwe Aickelin
KDD
2008
ACM
166views Data Mining» more  KDD 2008»
14 years 11 months ago
Generating succinct titles for web URLs
How can a search engine automatically provide the best and most appropriate title for a result URL (link-title) so that users will be persuaded to click on the URL? We consider th...
Deepayan Chakrabarti, Ravi Kumar, Kunal Punera