Sciweavers

20066 search results - page 387 / 4014
» T Spaces
Sort
View
ECML
2006
Springer
15 years 11 months ago
The Minimum Volume Covering Ellipsoid Estimation in Kernel-Defined Feature Spaces
Minimum volume covering ellipsoid estimation is important in areas such as systems identification, control, video tracking, sensor management, and novelty detection. It is well kno...
Alexander N. Dolia, Tijl De Bie, Christopher J. Ha...
EMO
2006
Springer
170views Optimization» more  EMO 2006»
15 years 11 months ago
Robust Multi-Objective Optimization in High Dimensional Spaces
1 In most real world optimization problems several optimization goals have to be considered in parallel. For this reason, there has been a growing interest in Multi-Objective Optim...
André Sülflow, Nicole Drechsler, Rolf ...
ESA
2006
Springer
130views Algorithms» more  ESA 2006»
15 years 11 months ago
Robust, Generic and Efficient Construction of Envelopes of Surfaces in Three-Dimensional Spaces
Lower envelopes are fundamental structures in computational geometry, which have many applications, such as computing general Voronoi diagrams and performing hidden surface removal...
Michal Meyerovitch
JSSPP
1995
Springer
15 years 11 months ago
Time Space Sharing Scheduling and Architectural Support
In this paper, we describe a new job scheduling class, called \Time Space Sharing Scheduling" (TSSS) for dynamically partitionable parallel machines. As an instance of TSSS, ...
Atsushi Hori, Takashi Yokota, Yutaka Ishikawa, Shu...
AAAI
2008
15 years 10 months ago
H-DPOP: Using Hard Constraints for Search Space Pruning in DCOP
In distributed constraint optimization problems, dynamic programming methods have been recently proposed (e.g. DPOP). In dynamic programming many valuations are grouped together i...
Akshat Kumar, Adrian Petcu, Boi Faltings