1184 search results - page 70 / 237 » Memory Design for Constrained Dynamic Optimization Problems |
146
Voted
CDC
2009
IEEE
15 years 3 months ago
2009
IEEE
Abstract-- An inverse modeling problem for systems governed by first-order, hyperbolic partial differential equations subject to periodic forcing is investigated. The problem is de...
137
click to vote
CASES
2003
ACM
15 years 7 months ago
2003
ACM
Dynamic software optimization methods are becoming increasingly popular for improving software performance and power. The first step in dynamic optimization consists of detecting ...
128
click to vote
STACS
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. The dynamic page migration problem [4] is defined in a distributed network of n mobile nodes sharing one indivisible memory page of size D. During runtime, the nodes can...
127
Voted
EMO
2001
Springer
15 years 7 months ago
2001
Springer
Abstract. Topology design of enterprise networks is a hard combinatorial optimization problem. It has numerous constraints, several objectives, and a very noisy solution space. Bes...
134
Voted
CPM
2005
Springer
15 years 4 months ago
2005
Springer
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...