Sciweavers

639 search results - page 74 / 128
» Dominance Constraints with Set Operators
Sort
View
CLIMA
2007
15 years 5 months ago
Language Constructs for Multi-agent Programming
Abstract. In this paper we are concerned with proposing, analyzing and implementing simple, yet flexible, constructs for multi-agent programming. In particular, we wish to extend ...
Louise A. Dennis, Michael Fisher, Anthony Hepple
ANOR
2011
117views more  ANOR 2011»
14 years 8 months ago
A simple and effective algorithm for the MaxMin diversity problem
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One ver...
Daniel Cosmin Porumbel, Jin-Kao Hao, Fred Glover
ISDA
2010
IEEE
15 years 2 months ago
Avoiding simplification strategies by introducing multi-objectiveness in real world problems
Abstract--In business analysis, models are sometimes oversimplified. We pragmatically approach many problems with a single financial objective and include monetary values for non-m...
Charlotte J. C. Rietveld, Gijs P. Hendrix, Frank T...
CODES
2007
IEEE
15 years 10 months ago
Reliable multiprocessor system-on-chip synthesis
This article presents a multiprocessor system-on-chip synthesis (MPSoC) algorithm that optimizes system mean time to failure. Given a set of directed acyclic periodic graphs of co...
Changyun Zhu, Zhenyu (Peter) Gu, Robert P. Dick, L...
PODS
2007
ACM
159views Database» more  PODS 2007»
16 years 4 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...