128 search results - page 15 / 26 » ants 2006 |
101
click to vote
FLAIRS
2006
15 years 1 months ago
2006
There exist a number of algorithms that can solve dynamic constraint satisfaction/optimization problems (DynCSPs or DynCOPs). Because of the large variety in the characteristics o...
111
click to vote
ANTSW
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. Wireless Sensor Networks are characterized by having specific requirements such as limited energy availability, low memory and reduced processing power. On the other hand...
DAC
2006
ACM
16 years 26 days ago
2006
ACM
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...
122
click to vote
EOR
2006
14 years 12 months ago
2006
One of the most important, common and critical management issues lies in determining the "best" project portfolio out of a given set of investment proposals. As this dec...
102
click to vote
ANTS
2006
Springer
15 years 3 months ago
2006
Springer
This paper aims at introducing generalized Jacobians as a new candidate for discrete logarithm (DL) based cryptography. The motivation for this work came from the observation that ...