Sciweavers

446 search results - page 42 / 90
» A new paradigm for programming competitions
Sort
View
AIPS
2008
13 years 11 months ago
Using Constraint Networks on Timelines to Model and Solve Planning and Scheduling Problems
In the last decades, there has been an increasing interest in the connection between planning and constraint programming. Several approaches were used, leading to different forms ...
Cédric Pralet, Gérard Verfaillie
ANOR
2011
158views more  ANOR 2011»
13 years 3 months ago
Hybrid scatter tabu search for unconstrained global optimization
Abstract The problem of finding a global optimum of an unconstrained multimodal function has been the subject of intensive study in recent years, giving rise to valuable advances ...
Abraham Duarte, Rafael Martí, Fred Glover, ...
JMLR
2012
11 years 11 months ago
A Simple Geometric Interpretation of SVM using Stochastic Adversaries
We present a minimax framework for classification that considers stochastic adversarial perturbations to the training data. We show that for binary classification it is equivale...
Roi Livni, Koby Crammer, Amir Globerson
HICSS
2008
IEEE
120views Biometrics» more  HICSS 2008»
14 years 3 months ago
Optimizing the Supplier Selection and Service Portfolio of a SOA Service Integrator
The Service-Oriented Architecture (SOA) paradigm promises to enable software vendors to compose software systems using services purchased from various suppliers. In this paper, we...
Jan Christian Lang, Thomas Widjaja, Peter Buxmann,...
CP
2005
Springer
14 years 2 months ago
Boosting Distributed Constraint Satisfaction
Abstract Competition and cooperation can boost the performance of a combinatorial search process. Both can be implemented with a portfolio of algorithms which run in parallel, give...
Georg Ringwelski, Youssef Hamadi