Sciweavers

1220 search results - page 198 / 244
» Minimal Interval Completions
Sort
View
CORR
2007
Springer
149views Education» more  CORR 2007»
13 years 7 months ago
Graph Entropy, Network Coding and Guessing games
We introduce the (private) entropy of a directed graph (in a new network coding sense) as well as a number of related concepts. We show that the entropy of a directed graph is ide...
Søren Riis
DAM
2007
100views more  DAM 2007»
13 years 7 months ago
Partially ordered knapsack and applications to scheduling
In the partially-ordered knapsack problem (POK) we are given a set N of items and a partial order ≺P on N. Each item has a size and an associated weight. The objective is to pac...
Stavros G. Kolliopoulos, George Steiner
JSW
2008
106views more  JSW 2008»
13 years 7 months ago
Factors that Significantly Impact the Implementation of an Agile Software Development Methodology
The Internet economy has altered the current rules of software engineering. Traditional development methodologies have proven too cumbersome to meet the rapidly changing requiremen...
Jeffrey A. Livermore
JUCS
2008
158views more  JUCS 2008»
13 years 7 months ago
Algebraic Laws for Feature Models
: Software Product Lines (SPL) may be adopted by either bootstrapping existing software products into a SPL, or extending an existing SPL to encompass an additional software produc...
Rohit Gheyi, Tiago Massoni, Paulo Borba
ECCC
2007
99views more  ECCC 2007»
13 years 7 months ago
An Exponential Time/Space Speedup For Resolution
Satisfiability algorithms have become one of the most practical and successful approaches for solving a variety of real-world problems, including hardware verification, experime...
Philipp Hertel, Toniann Pitassi