Sciweavers

408 search results - page 69 / 82
» A lookahead strategy for solving large planning problems
Sort
View
ICNC
2005
Springer
15 years 3 months ago
Training Data Selection for Support Vector Machines
Abstract. In recent years, support vector machines (SVMs) have become a popular tool for pattern recognition and machine learning. Training a SVM involves solving a constrained qua...
Jigang Wang, Predrag Neskovic, Leon N. Cooper
MWCN
2004
Springer
15 years 3 months ago
Route Stability Techniques for Enhanced Video Delivery on Manets
Abstract One of the main problems associated with MANETs is that mobility and the associated route discovery and maintenance procedures of reactive routing protocols cause interrup...
Carlos Miguel Tavares Calafate, Manuel P. Malumbre...
87
Voted
TOG
2002
133views more  TOG 2002»
14 years 9 months ago
Interactive motion generation from examples
There are many applications that demand large quantities of natural looking motion. It is difficult to synthesize motion that looks natural, particularly when it is people who mus...
Okan Arikan, David A. Forsyth
86
Voted
CP
2009
Springer
14 years 7 months ago
Minimizing the Maximum Number of Open Stacks by Customer Search
We describe a new exact solver for the minimization of open stacks problem (MOSP). By combining nogood recording with a branch and bound strategy based on choosing which customer s...
Geoffrey Chu, Peter J. Stuckey
TON
2010
147views more  TON 2010»
14 years 8 months ago
Coverage-time optimization for clustered wireless sensor networks: a power-balancing approach
—In this paper, we investigate the maximization of the coverage time for a clustered wireless sensor network (WSN) by optimal balancing of power consumption among cluster heads (...
Tao Shu, Marwan Krunz