Sciweavers

1405 search results - page 141 / 281
» Popularity at Minimum Cost
Sort
View
ESA
2006
Springer
131views Algorithms» more  ESA 2006»
15 years 8 months ago
Finding Total Unimodularity in Optimization Problems Solved by Linear Programs
A popular approach in combinatorial optimization is to model problems as integer linear programs. Ideally, the relaxed linear program would have only integer solutions, which happ...
Christoph Dürr, Mathilde Hurand
DAC
1995
ACM
15 years 8 months ago
Conflict Modelling and Instruction Scheduling in Code Generation for In-House DSP Cores
Application domain specific DSP cores are becoming increasingly popular due to their advantageous trade–off between flexibility and cost. However, existing code generation metho...
Adwin H. Timmer, Marino T. J. Strik, Jef L. van Me...
FLAIRS
2007
15 years 6 months ago
Dynamic DDN Construction for Lightweight Planning Architectures
POMDPs are a popular framework for representing decision making problems that contain uncertainty. The high computational complexity of finding exact solutions to POMDPs has spaw...
William H. Turkett
136
Voted
SERVICES
2010
220views more  SERVICES 2010»
15 years 6 months ago
An application-centric model for cloud management
The cloud model is increasingly popular as a means of creating dynamic, flexible and cost effective networkcentric application infrastructures. The model separates the applications...
Terence J. Harmer, Peter Wright, Christina Cunning...
116
Voted
ICONIP
2007
15 years 6 months ago
Practical Recurrent Learning (PRL) in the Discrete Time Domain
One of the authors has proposed a simple learning algorithm for recurrent neural networks, which requires computational cost and memory capacity in practical order O(n2 )[1]. The a...
Mohamad Faizal Bin Samsudin, Takeshi Hirose, Katsu...