Sciweavers

576 search results - page 61 / 116
» Matching methodology to problem domain
Sort
View
AIPS
2006
13 years 10 months ago
Optimal Rectangle Packing: A Meta-CSP Approach
We present a new approach to optimal rectangle packing, an NP-complete problem that can be used to model many simple scheduling tasks. Recent attempts at incorporating artificial ...
Michael D. Moffitt, Martha E. Pollack
TEC
2010
193views more  TEC 2010»
13 years 3 months ago
Chemical-Reaction-Inspired Metaheuristic for Optimization
-- We encounter optimization problems in our daily lives and in various research domains. Some of them are so hard that we can, at best, approximate the best solutions with (meta-)...
Albert Y. S. Lam, Victor O. K. Li
CVPR
2010
IEEE
14 years 5 months ago
3D Shape Correspondence by Isometry-Driven Greedy Optimization
We present an automatic method that establishes 3D correspondence between isometric shapes. Our goal is to find an optimal correspondence between two given (nearly) isometric sha...
Yusuf Sahillioglu, Yucel Yemez
WECWIS
2008
IEEE
127views ECommerce» more  WECWIS 2008»
14 years 3 months ago
SSWiM: A Semantic Service, Wrapper and Invocation Manager
Integrating service description, discovery, and invocation functionalities presents several fundamental problems in the management of web services and is a basic problem for compo...
Anna Sibirtseva, Zhongnan Shen, Jianwen Su, Fulian...
WWW
2009
ACM
14 years 9 months ago
Understanding user's query intent with wikipedia
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...
Jian Hu, Gang Wang, Frederick H. Lochovsky, Jian-T...