2109 search results - page 228 / 422 » Solving Necklace Constraint Problems |
161
click to vote
DAC
1995
ACM
15 years 9 months ago
1995
ACM
Application domain specific DSP cores are becoming increasingly popular due to their advantageous trade–off between flexibility and cost. However, existing code generation metho...
129
click to vote
ICMAS
2000
15 years 7 months ago
2000
When shall I fly to New York? Which airline should I choose? How are these related to which airport I arrive at, to how I might travel into the city and to where I choose to stay?...
132
click to vote
COLING
1996
15 years 7 months ago
1996
This paper presents a comtmtational model of incremental utterance production in task-oriented dialogues. This model incrementally produces utterantes to propose the solution of a...
156
Voted
CEC
2010
IEEE
15 years 7 months ago
2010
IEEE
This paper presents an adaptation of a novel algorithm based on the foraging behavior of honey bees to solve constrained numerical optimization problems. The modifications focus on...
169
click to vote
JAIR
2007
15 years 6 months ago
2007
Most classical scheduling formulations assume a fixed and known duration for each activity. In this paper, we weaken this assumption, requiring instead that each duration can be ...