Sciweavers

19130 search results - page 96 / 3826
» Modelling multi-path problems
Sort
View
SODA
2004
ACM
104views Algorithms» more  SODA 2004»
15 years 7 months ago
Tight bounds for the partial-sums problem
We close the gaps between known lower and upper bounds for the online partial-sums problem in the RAM and group models of computation. If elements are chosen from an abstract grou...
Mihai Patrascu, Erik D. Demaine
AAAI
2006
15 years 7 months ago
Strategy Variations in Analogical Problem Solving
While it is commonly agreed that analogy is useful in human problem solving, exactly how analogy can and should be used remains an intriguing problem. VanLehn (1998) for instance ...
Tom Y. Ouyang, Kenneth D. Forbus
VLSID
2008
IEEE
149views VLSI» more  VLSID 2008»
16 years 6 months ago
NBTI Degradation: A Problem or a Scare?
Negative Bias Temperature Instability (NBTI) has been identified as a major and critical reliability issue for PMOS devices in nano-scale designs. It manifests as a negative thres...
Kewal K. Saluja, Shriram Vijayakumar, Warin Sootka...
ASIAMS
2007
IEEE
16 years 20 days ago
Solving Shortest Capacitated Path Problem Using a Bi-Objective Heuristic Approach
The shortest capacitated path problem is a well known problem in the networking area, having a wide range of applications. In the shortest capacitated path problem, a traffic flow...
Crina Grosan, Ajith Abraham
ECML
2005
Springer
15 years 12 months ago
A SAT-Based Version Space Algorithm for Acquiring Constraint Satisfaction Problems
Constraint programming is rapidly becoming the technology of choice for modelling and solving complex combinatorial problems. However, users of this technology need significant ex...
Christian Bessière, Remi Coletta, Fré...