Sciweavers

2254 search results - page 281 / 451
» Computing the minimal covering set
Sort
View
ACL
1990
15 years 7 months ago
Automated Inversion of Logic Grammars for Generation
We describe a system of reversible grammar in which, given a logic-grammar specification of a natural language, two efficient PROLOGprograms are derived by an off-line compilation...
Tomek Strzalkowski, Ping Peng
AIPS
2009
15 years 7 months ago
Multi-Agent Online Planning with Communication
We propose an online algorithm for planning under uncertainty in multi-agent settings modeled as DEC-POMDPs. The algorithm helps overcome the high computational complexity of solv...
Feng Wu, Shlomo Zilberstein, Xiaoping Chen
GECCO
2008
Springer
152views Optimization» more  GECCO 2008»
15 years 7 months ago
Designing EDAs by using the elitist convergent EDA concept and the boltzmann distribution
This paper presents a theoretical definition for designing EDAs called Elitist Convergent Estimation of Distribution Algorithm (ECEDA), and a practical implementation: the Boltzm...
Sergio Ivvan Valdez Peña, Arturo Hern&aacut...
CORR
2008
Springer
114views Education» more  CORR 2008»
15 years 6 months ago
Support Vector Machine Classification with Indefinite Kernels
In this paper, we propose a method for support vector machine classification using indefinite kernels. Instead of directly minimizing or stabilizing a nonconvex loss function, our...
Ronny Luss, Alexandre d'Aspremont
COR
2006
88views more  COR 2006»
15 years 6 months ago
An exact algorithm for the capacitated vertex p-center problem
We develop a simple and practical exact algorithm for the problem of locating p facilities and assigning clients7 to them within capacity restrictions in order to minimize the max...
F. Aykut Özsoy, Mustafa Ç. Pinar