1972 search results - page 271 / 395 » Evolutionary algorithms and dynamic programming |
187
click to vote
SIGOPS
2011
14 years 11 months ago
2011
While application performance and power-efficiency are both important, application correctness is even more important. In other words, if the application is misbehaving, it is li...
140
click to vote
ICALP
2003
Springer
15 years 10 months ago
2003
Springer
Abstract. In this paper we consider the problem of routing packets in dynamically changing networks, using the anycast mode. In anycasting, a packet may have a set of destinations ...
157
click to vote
BMCBI
2004
15 years 4 months ago
2004
Background: RNA secondary structure prediction methods based on probabilistic modeling can be developed using stochastic context-free grammars (SCFGs). Such methods can readily co...
134
click to vote
VEE
2009
ACM
15 years 11 months ago
2009
ACM
Clusters provide powerful computing environments, but in practice much of this power goes to waste, due to the static allocation of tasks to nodes, regardless of their changing co...
144
click to vote
TASE
2008
IEEE
15 years 4 months ago
2008
IEEE
This paper addresses the general single-machine earliness-tardiness problem with distinct release dates, due dates, and unit costs. The aim of this research is to obtain an exact n...