Sciweavers

1578 search results - page 313 / 316
» Direct Routing: Algorithms and Complexity
Sort
View
GPEM
2008
128views more  GPEM 2008»
13 years 8 months ago
Coevolutionary bid-based genetic programming for problem decomposition in classification
In this work a cooperative, bid-based, model for problem decomposition is proposed with application to discrete action domains such as classification. This represents a significan...
Peter Lichodzijewski, Malcolm I. Heywood
CGF
2006
191views more  CGF 2006»
13 years 8 months ago
A Robust Two-Step Procedure for Quad-Dominant Remeshing
We propose a new technique for quad-dominant remeshing which separates the local regularity requirements from the global alignment requirements by working in two steps. In the fir...
Martin Marinov, Leif Kobbelt
MANSCI
2008
96views more  MANSCI 2008»
13 years 8 months ago
Staffing of Time-Varying Queues to Achieve Time-Stable Performance
Continuing research by Jennings, Mandelbaum, Massey and Whitt (1996), we investigate methods to perform time-dependent staffing for many-server queues. Our aim is to achieve time-...
Zohar Feldman, Avishai Mandelbaum, William A. Mass...
FGCS
2007
160views more  FGCS 2007»
13 years 8 months ago
Distributed data mining in grid computing environments
The computing-intensive data mining for inherently Internet-wide distributed data, referred to as Distributed Data Mining (DDM), calls for the support of a powerful Grid with an e...
Ping Luo, Kevin Lü, Zhongzhi Shi, Qing He
PAMI
2006
227views more  PAMI 2006»
13 years 8 months ago
Matching 2.5D Face Scans to 3D Models
The performance of face recognition systems that use two-dimensional images depends on factors such as lighting and subject's pose. We are developing a face recognition system...
Xiaoguang Lu, Anil K. Jain, Dirk Colbry