Sciweavers

175 search results - page 30 / 35
» Adaptive evolution: an efficient heuristic for global optimi...
Sort
View
ESWA
2007
100views more  ESWA 2007»
14 years 9 months ago
Using memetic algorithms with guided local search to solve assembly sequence planning
The goal of assembly planning consists in generating feasible sequences to assemble a product and selecting an efficient assembly sequence from which related constraint factors su...
Hwai-En Tseng, Wen-Pai Wang, Hsun-Yi Shih
WWW
2011
ACM
14 years 4 months ago
Web scale NLP: a case study on url word breaking
This paper uses the URL word breaking task as an example to elaborate what we identify as crucialin designingstatistical natural language processing (NLP) algorithmsfor Web scale ...
Kuansan Wang, Christopher Thrasher, Bo-June Paul H...
ECCV
2008
Springer
15 years 11 months ago
Integration of Multiview Stereo and Silhouettes Via Convex Functionals on Convex Domains
We propose a convex framework for silhouette and stereo fusion in 3D reconstruction from multiple images. The key idea is to show that the reconstruction problem can be cast as one...
Kalin Kolev, Daniel Cremers
ICIP
2010
IEEE
14 years 7 months ago
A game theoretical approach for image denoising
How to adaptively choose optimal neighborhoods is very important to pixel-domain image denoising algorithms since too many neighborhoods may cause over-smooth artifacts and too fe...
Yan Chen, K. J. Ray Liu
ATAL
2006
Springer
15 years 1 months ago
Winning back the CUP for distributed POMDPs: planning over continuous belief spaces
Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are evolving as a popular approach for modeling multiagent systems, and many different algorithms ha...
Pradeep Varakantham, Ranjit Nair, Milind Tambe, Ma...