Sciweavers

14518 search results - page 141 / 2904
» Two Problems for Sophistication
Sort
View
WG
2005
Springer
14 years 3 months ago
Approximation Algorithms for the Bi-criteria Weighted max-cut Problem
Abstract. We consider a generalization of the classical max-cut problem where two objective functions are simultaneously considered. We derive some theorems on the existence and th...
Eric Angel, Evripidis Bampis, Laurent Gourvè...
RSA
2006
104views more  RSA 2006»
13 years 10 months ago
The satisfiability threshold for randomly generated binary constraint satisfaction problems
Abstract. We study two natural models of randomly generated constraint satisfaction problems. We determine how quickly the domain size must grow with n to ensure that these models ...
Alan M. Frieze, Michael Molloy
TASLP
2010
78views more  TASLP 2010»
13 years 5 months ago
Solving Demodulation as an Optimization Problem
We introduce two new methods for the demodulation of acoustic signals by posing the problem in a convex optimization framework. This allows the parameters of the modulator and carr...
Gregory Sell, Malcolm Slaney
EUROCAST
2007
Springer
126views Hardware» more  EUROCAST 2007»
14 years 4 months ago
Parallel Tabu Search and the Multiobjective Capacitated Vehicle Routing Problem with Soft Time Windows
Abstract. In this paper the author presents three approaches to parallel Tabu Search, applied to several instances of the Capacitated Vehicle Routing Problem with soft Time Windows...
Andreas Beham
SELMAS
2005
Springer
14 years 3 months ago
Agent Roles, Qua Individuals and the Counting Problem
Despite the relevance of the concept of role for conceptual modeling and agent-orientation, there is still in the literature a lack of consensus on the meaning of this notion and h...
Giancarlo Guizzardi