Sciweavers

2100 search results - page 205 / 420
» Fundamentals of the problem
Sort
View
BROADNETS
2004
IEEE
15 years 4 months ago
Routing in Ad Hoc Networks-A Wireless Perspective
Traditionally, the routing problem is addressed at the network layer, an approach that has been extended to the wireless realm. In wireless multihop networks, however, strict laye...
Martin Haenggi
107
Voted
FLAIRS
2008
15 years 3 months ago
A Novel Prioritization Technique for Solving Markov Decision Processes
We address the problem of computing an optimal value function for Markov decision processes. Since finding this function quickly and accurately requires substantial computation ef...
Jilles Steeve Dibangoye, Brahim Chaib-draa, Abdel-...
143
Voted
DISOPT
2011
210views Education» more  DISOPT 2011»
14 years 7 months ago
The parameterized complexity of k-flip local search for SAT and MAX SAT
SAT and MAX SAT are among the most prominent problems for which local search algorithms have been successfully applied. A fundamental task for such an algorithm is to increase the...
Stefan Szeider
103
Voted
SEKE
2005
Springer
15 years 6 months ago
An Empirical Study on Limits of Clone Unification Using Generics
Generics (templates) attempt to unify similar program structures to avoid redundancy. How well do generics serve this purpose in practice? We try to answer this question through e...
Hamid Abdul Basit, Damith C. Rajapakse, Stan Jarza...
GPCE
2009
Springer
15 years 4 months ago
Mapping problem-space to solution-space features: a feature interaction approach
Mapping problem-space features into solution-space features is a fundamental configuration problem in software product line engineering. A configuration problem is defined as g...
Frans Sanen, Eddy Truyen, Wouter Joosen