Sciweavers

187 search results - page 21 / 38
» Benchmarking and solving dynamic constrained problems
Sort
View
67
Voted
DAC
2006
ACM
15 years 10 months ago
Design space exploration using time and resource duality with the ant colony optimization
Design space exploration during high level synthesis is often conducted through ad-hoc probing of the solution space using some scheduling algorithm. This is not only time consumi...
Gang Wang, Wenrui Gong, Brian DeRenzi, Ryan Kastne...
DDECS
2008
IEEE
137views Hardware» more  DDECS 2008»
15 years 4 months ago
Cluster-based Simulated Annealing for Mapping Cores onto 2D Mesh Networks on Chip
Abstract—In Network-on-Chip (NoC) application design, coreto-node mapping is an important but intractable optimization problem. In the paper, we use simulated annealing to tackle...
Zhonghai Lu, Lei Xia, Axel Jantsch
HEURISTICS
2002
152views more  HEURISTICS 2002»
14 years 9 months ago
A Constraint-Based Method for Project Scheduling with Time Windows
This paper presents a heuristic algorithm for solving RCPSP/max, the resource constrained project scheduling problem with generalized precedence relations. The algorithm relies, a...
Amedeo Cesta, Angelo Oddi, Stephen F. Smith
77
Voted
ATAL
2010
Springer
14 years 10 months ago
Dynamic generation and execution of human aware navigation plans
d Abstract) Thibault Kruse, Alexandra Kirsch, E. Akin Sisbot, Rachid Alami A robot moving in the presence of humans is highly constrained by the dynamic environment and the need t...
Thibault Kruse, Alexandra Kirsch, Emrah Akin Sisbo...
INFOCOM
2011
IEEE
14 years 1 months ago
A dynamic relay selection scheme for mobile users in wireless relay networks
—Cooperative communication has attracted dramatic attention in the last few years due to its advantage in mitigating channel fading. Despite much effort that has been made in the...
Yifan Li, Ping Wang, Dusit Niyato, Weihua Zhuang