Sciweavers

536 search results - page 2 / 108
» AI techniques in modelling, assignment, problem solving and ...
Sort
View
IPPS
2003
IEEE
13 years 10 months ago
Constrained Component Deployment in Wide-Area Networks Using AI Planning Techniques
Component-based models represent a dominant trend in the construction of wide-area network applications, making possible the integration of diverse functionality contained in modu...
Tatiana Kichkaylo, Anca-Andreea Ivan, Vijay Karamc...
COMCOM
2007
123views more  COMCOM 2007»
13 years 5 months ago
Heuristic and optimal techniques for light-trail assignment in optical ring WDM networks
In this paper we address the problem of constrained optimization (ILP formulation) and propose a set of heuristic algorithms for assigning light-trails [1–4,7,10] to WDM ring ne...
Ashwin Gumaste, Paparao Palacharla
FGCS
2000
90views more  FGCS 2000»
13 years 5 months ago
An ANTS heuristic for the frequency assignment problem
The problem considered in this paper consists in defining an assignment of frequencies to radio links, to be established between base stations and mobile transmitters, which minim...
Vittorio Maniezzo, Antonella Carbonaro
ESA
2006
Springer
131views Algorithms» more  ESA 2006»
13 years 9 months ago
Finding Total Unimodularity in Optimization Problems Solved by Linear Programs
A popular approach in combinatorial optimization is to model problems as integer linear programs. Ideally, the relaxed linear program would have only integer solutions, which happ...
Christoph Dürr, Mathilde Hurand
AI
2010
Springer
13 years 5 months ago
Soft arc consistency revisited
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
Martin C. Cooper, Simon de Givry, M. Sanchez, Thom...