1197 search results - page 171 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
RTSS
1999
IEEE
14 years 12 days ago
1999
IEEE
Despite the significant body of results in real-time scheduling, many real world problems are not easily supported. While algorithms such as Earliest Deadline First, Rate Monotoni...
RECOMB
1997
Springer
14 years 8 days ago
1997
Springer
Multiple sequence alignment is an important problem in computational biology. We study the Maximum Trace formulation introduced by Kececioglu [?]. We first phrase the problem in ...
VLSID
1999
IEEE
14 years 12 days ago
1999
IEEE
In this paper we address the problem of detailed FPGA routing using Boolean formulation methods. In the context of FPGA routing where routing resources are fixed, Boolean formulat...
ICIP
1995
IEEE
13 years 11 months ago
1995
IEEE
Abstract— Motion discontinuities arise when there are occlusions or multiple moving objects in the scene that is imaged. Conventional regularization techniques use smoothness con...
GLOBECOM
2008
IEEE
14 years 2 months ago
2008
IEEE
—We present a novel approach for minimizing the energy consumption of medium access control (MAC) protocols developed for duty-cycled wireless sensor networks (WSN) for the unslo...