Sciweavers

478 search results - page 59 / 96
» Approximation algorithms for general packing problems and th...
Sort
View
AAAI
2007
13 years 11 months ago
Anytime Coordination Using Separable Bilinear Programs
Developing scalable coordination algorithms for multi-agent systems is a hard computational challenge. One useful approach, demonstrated by the Coverage Set Algorithm (CSA), explo...
Marek Petrik, Shlomo Zilberstein
PKDD
2009
Springer
184views Data Mining» more  PKDD 2009»
14 years 1 months ago
Boosting Active Learning to Optimality: A Tractable Monte-Carlo, Billiard-Based Algorithm
Abstract. This paper focuses on Active Learning with a limited number of queries; in application domains such as Numerical Engineering, the size of the training set might be limite...
Philippe Rolet, Michèle Sebag, Olivier Teyt...
GECCO
2007
Springer
184views Optimization» more  GECCO 2007»
14 years 18 days ago
Multi-objective optimization tool for a free structure analog circuits design using genetic algorithms and incorporating parasit
This paper presents a novel approach for a free structure analog circuit design using Genetic Algorithms (GA). A major problem in a free structure circuit is its sensitivity calcu...
Yaser M. A. Khalifa, Badar K. Khan, Faisal Taha
GECCO
2009
Springer
14 years 3 months ago
An evolutionary approach to planning IEEE 802.16 networks
Efficient and effective deployment of IEEE 802.16 networks to service an area of users with certain traffic demands is an important network planning problem. We resort to an evol...
Ting Hu, Yuanzhu Peter Chen, Wolfgang Banzhaf, Rob...
COMPGEOM
2003
ACM
14 years 2 months ago
Restricted delaunay triangulations and normal cycle
We address the problem of curvature estimation from sampled smooth surfaces. Building upon the theory of normal cycles, we derive a definition of the curvature tensor for polyhed...
David Cohen-Steiner, Jean-Marie Morvan