Sciweavers

11 search results - page 2 / 3
» Modelling Combinatorial Auctions in Linear Logic
Sort
View
FOSSACS
2005
Springer
15 years 5 months ago
Mathematical Models of Computational and Combinatorial Structures
The general aim of this talk is to advocate a combinatorial perspective, together with its methods, in the investigation and study of models of computation structures. This, of cou...
Marcelo P. Fiore
CPAIOR
2006
Springer
15 years 3 months ago
AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
Radu Marinescu 0002, Rina Dechter
CVPR
2012
IEEE
13 years 2 months ago
On multiple foreground cosegmentation
In this paper, we address a challenging image segmentation problem called multiple foreground cosegmentation (MFC), which concerns a realistic scenario in general Webuser photo se...
Gunhee Kim, Eric P. Xing
ATAL
2003
Springer
15 years 4 months ago
Model checking agentspeak
This paper introduces AgentSpeak(F), a variation of the BDI logic programming language AgentSpeak(L) intended to permit the model-theoretic verification of multi-agent systems. A...
Rafael H. Bordini, Michael Fisher, Carmen Pardavil...
CPAIOR
2007
Springer
15 years 5 months ago
Best-First AND/OR Search for 0/1 Integer Programming
Abstract. AND/OR search spaces are a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensitivity to the struc...
Radu Marinescu 0002, Rina Dechter