Sciweavers

1968 search results - page 256 / 394
» The Complexity of Valued Constraint Models
Sort
View
ASWEC
2007
IEEE
15 years 4 months ago
Supporting OO Design Heuristics
Heuristics have long been recognised as a way to tackle problems which are intractable because of their size or complexity. They have been used in software engineering for purpose...
Neville Churcher, Sarah Frater, Cong Phuoc Huynh, ...
AIPS
2008
15 years 11 days ago
Multiagent Planning Under Uncertainty with Stochastic Communication Delays
We consider the problem of cooperative multiagent planning under uncertainty, formalized as a decentralized partially observable Markov decision process (Dec-POMDP). Unfortunately...
Matthijs T. J. Spaan, Frans A. Oliehoek, Nikos A. ...
CONCUR
1998
Springer
15 years 2 months ago
Algebraic Techniques for Timed Systems
Performance evaluation is a central issue in the design of complex real-time systems. In this work, we propose an extension of socalled "Max-Plus" algebraic techniques to...
Albert Benveniste, Claude Jard, Stephane Gaubert
SIGECOM
2009
ACM
108views ECommerce» more  SIGECOM 2009»
15 years 4 months ago
Selling ad campaigns: online algorithms with cancellations
We study online pricing problems in markets with cancellations, i.e., markets in which prior allocation decisions can be revoked, but at a cost. In our model, a seller receives re...
Moshe Babaioff, Jason D. Hartline, Robert D. Klein...
CVPR
1998
IEEE
16 years 1 days ago
Comparing Images under Variable Illumination
We consider the problem of determining whether two images come from different objects or the same object in the same pose, but under different illumination conditions. We show tha...
David W. Jacobs, Peter N. Belhumeur, Ronen Basri