3433 search results - page 310 / 687 » Heuristics for a bidding problem |
185
click to vote
INFOCOM
1998
IEEE
15 years 11 months ago
1998
IEEE
: This paper presents a demand-based engineering method for designing radio networks of cellularmobile communicationsystems. The proposed procedure is based on a forward-engineerin...
173
click to vote
ASPDAC
1998
ACM
15 years 11 months ago
1998
ACM
- In this paper, we study the wire sizing and wire spacing problem for post-layout performance optimization under Elmore delay model. Both ground capacitance and coupled capacitanc...
196
click to vote
EPS
1998
Springer
15 years 11 months ago
1998
Springer
This paper reports work investigating various evolutionary approaches to vertex cover (VC), a well-known NP-Hard optimization problem. Central to each of the algorithms is a novel ...
175
click to vote
VLDB
1997
ACM
15 years 11 months ago
1997
ACM
Scheduling query execution plans is a particularly complex problem in hierarchical parallel systems, where each site consists of a collection of local time-shared (e.g., CPU(s) or...
174
Voted
KR
1989
Springer
15 years 10 months ago
1989
Springer
In this work we extend the work of Dean, Kaelbling, Kirman and Nicholson on planning under time constraints in stochastic domains to handle more complicated scheduling problems. I...