Sciweavers

2124 search results - page 251 / 425
» An Efficient Framework for Order Optimization
Sort
View
AIPS
2008
15 years 8 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
CARDIS
2008
Springer
146views Hardware» more  CARDIS 2008»
15 years 8 months ago
Provably Secure Grouping-Proofs for RFID Tags
We investigate an application of RFIDs referred to in the literature as group scanning, in which several tags are "simultaneously" scanned by a reader device. Our goal is...
Mike Burmester, Breno de Medeiros, Rossana Motta
COLT
2008
Springer
15 years 8 months ago
Learning Coordinate Gradients with Multi-Task Kernels
Coordinate gradient learning is motivated by the problem of variable selection and determining variable covariation. In this paper we propose a novel unifying framework for coordi...
Yiming Ying, Colin Campbell
NIPS
2004
15 years 8 months ago
Exponentiated Gradient Algorithms for Large-margin Structured Classification
We consider the problem of structured classification, where the task is to predict a label y from an input x, and y has meaningful internal structure. Our framework includes super...
Peter L. Bartlett, Michael Collins, Benjamin Taska...
IJCAI
2003
15 years 8 months ago
Reasoning about soft constraints and conditional preferences: complexity results and approximation techniques
Many real life optimization problems contain both hard and soft constraints, as well as qualitative conditional preferences. However, there is no single formalism to specify all t...
Carmel Domshlak, Francesca Rossi, Kristen Brent Ve...