Sciweavers

592 search results - page 53 / 119
» Using Constraint Programming to Solve the Maximum Clique Pro...
Sort
View
COR
2006
108views more  COR 2006»
15 years 3 months ago
Variable neighborhood search and local branching
In this paper we develop a variable neighborhood search (VNS) heuristic for solving mixed-integer programs (MIPs). It uses CPLEX, the general-purpose MIP solver, as a black-box. N...
Pierre Hansen, Nenad Mladenovic, Dragan Urosevic
CONSTRAINTS
2008
117views more  CONSTRAINTS 2008»
15 years 3 months ago
Domain Specific High-Level Constraints for User Interface Layout
We present the Auckland Layout Model (ALM), a constraint-based technique for specifying 2D layout as it is used for arranging the controls in a GUI. Most GUI frameworks offer layo...
Christof Lutteroth, Robert Strandh, Gerald Weber
WIOPT
2010
IEEE
15 years 1 months ago
Optimizing power allocation in interference channels using D.C. programming
Abstract--Power allocation is a promising approach for optimizing the performance of mobile radio systems in interference channels. In the present paper, the non-convex objective f...
Hussein Al-Shatri, Tobias Weber
PARELEC
2002
IEEE
15 years 8 months ago
Techniques for Optimization of Net Algorithms
In this paper, techniques for optimization of net algorithms describing parallel asynchronous computations and derived from cycling and branching behavioral descriptions are prese...
Anatoly Prihozhy, Daniel Mlynek, Michail Solomenni...
IJAOSE
2010
227views more  IJAOSE 2010»
15 years 1 months ago
Implementing reactive BDI agents with user-given constraints and objectives
CASO is an agent-oriented programming language based on AgentSpeak(L), one of the most influential abstract languages based on the BDI (Beliefs-Desires-Intentions) architecture. ...
Aniruddha Dasgupta, Aditya K. Ghose