Sciweavers

1225 search results - page 165 / 245
» The Instance Complexity Conjecture
Sort
View
LION
2009
Springer
145views Optimization» more  LION 2009»
14 years 3 months ago
A Variable Neighborhood Descent Search Algorithm for Delay-Constrained Least-Cost Multicast Routing
Abstract. The rapid evolution of real-time multimedia applications requires Quality of Service (QoS) based multicast routing in underlying computer networks. The constrained Steine...
Rong Qu, Ying Xu, Graham Kendall
REFSQ
2009
Springer
14 years 3 months ago
Composing Models for Detecting Inconsistencies: A Requirements Engineering Perspective
Abstract. [Context and motivation] Ever-growing systems’ complexity and novel requirements engineering approaches such as reuse or globalization imply that requirements are produ...
Gilles Perrouin, Erwan Brottier, Benoit Baudry, Yv...
SARA
2009
Springer
14 years 3 months ago
Common Subexpressions in Constraint Models of Planning Problems
Constraint Programming is an attractive approach for solving AI planning problems by modelling them as Constraint Satisfaction Problems (CSPs). However, formulating effective cons...
Andrea Rendl, Ian Miguel, Ian P. Gent, Peter Grego...
CASES
2009
ACM
14 years 3 months ago
Hybrid multithreading for VLIW processors
Several multithreading techniques have been proposed to reduce resource underutilization in Very Long Instruction Word (VLIW) processors. Simultaneous MultiThreading (SMT) is a po...
Manoj Gupta, Fermín Sánchez, Josep L...
ISSTA
2009
ACM
14 years 3 months ago
Memory slicing
Traditional dynamic program slicing techniques are code-centric, meaning dependences are introduced between executed statement instances, which gives rise to various problems such...
Bin Xin, Xiangyu Zhang