Sciweavers

694 search results - page 44 / 139
» Abstracting Allocation
Sort
View
APPROX
2008
Springer
107views Algorithms» more  APPROX 2008»
14 years 12 months ago
A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined in
Abstract. In this paper, we propose a general framework for designing fully polynomial time approximation schemes for combinatorial optimization problems, in which more than one ob...
Shashi Mittal, Andreas S. Schulz
ECAI
2010
Springer
14 years 11 months ago
Modelling Multilateral Negotiation in Linear Logic
Abstract. We show how to embed a framework for multilateral negotiation, in which a group of agents implement a sequence of deals concerning the exchange of a number of resources, ...
Daniele Porello, Ulle Endriss
ICPR
2010
IEEE
14 years 9 months ago
2LDA: Segmentation for Recognition
Abstract—Following the trend of “segmentation for recognition”, we present 2LDA, a novel generative model to automatically segment an image in 2 segments, background and fore...
Alessandro Perina, Marco Cristani, Vittorio Murino
CPAIOR
2007
Springer
15 years 4 months ago
Generalizations of the Global Cardinality Constraint for Hierarchical Resources
Abstract. We propose generalizations of the Global Cardinality Constraint (gcc) in which a partition of the variables is given. In the context of resource allocation problems, such...
Alessandro Zanarini, Gilles Pesant
IVA
2005
Springer
15 years 3 months ago
Do You See What Eyes See? Implementing Inattentional Blindness
Abstract. This paper presents a computational model of visual attention incorporating a cognitive imperfection known as inattentional blindness. We begin by presenting four factors...
Erdan Gu, Catherine Stocker, Norman I. Badler