Sciweavers

Share
754 search results - page 2 / 151
» Robust Constraint Solving Using Multiple Heuristics
Sort
View
ASIAMS
2007
IEEE
10 years 6 months ago
Solving Shortest Capacitated Path Problem Using a Bi-Objective Heuristic Approach
The shortest capacitated path problem is a well known problem in the networking area, having a wide range of applications. In the shortest capacitated path problem, a traffic flow...
Crina Grosan, Ajith Abraham
TASE
2010
IEEE
9 years 6 months ago
Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
SOCC
2008
IEEE
124views Education» more  SOCC 2008»
10 years 6 months ago
Energy minimization using a greedy randomized heuristic for the voltage assignment problem in NoC
— Scaling down the voltage levels of the processing elements (PEs) in a Network-on-Chip (NoC) can significantly reduce the computation energy consumption with an overhead of the...
Pavel Ghosh, Arunabha Sen
PC
2000
160views Management» more  PC 2000»
9 years 11 months ago
Parallel algorithms to solve two-stage stochastic linear programs with robustness constraints
In this paper we present a parallel method for solving two-stage stochastic linear programs with restricted recourse. The mathematical model considered here can be used to represe...
Patrizia Beraldi, Lucio Grandinetti, Roberto Musma...
CP
2001
Springer
10 years 4 months ago
Collaborative Learning for Constraint Solving
Abstract. Although constraint programming offers a wealth of strong, generalpurpose methods, in practice a complex, real application demands a person who selects, combines, and ref...
Susan L. Epstein, Eugene C. Freuder
books