Sciweavers

3946 search results - page 180 / 790
» The computational complexity of choice sets
Sort
View
NETCOOP
2007
Springer
16 years 22 days ago
How Expensive Is Link Utilization?
Understanding the relationship between queueing delays and link utilization for general traffic conditions is an important open problem in networking research. Difficulties in unde...
Rade Stanojevic, Robert Shorten
LPNMR
1997
Springer
15 years 10 months ago
Computing Non-Ground Representations of Stable Models
Turi [20] introduced the important notion of a constrained atom: an atom with associated equality and disequality constraints on its arguments. A set of constrained atoms is a cons...
Thomas Eiter, James J. Lu, V. S. Subrahmanian
CG
2004
Springer
15 years 6 months ago
Views of Fibonacci dynamics
The Binet formula gives a natural way for Fibonacci numbers to be viewed as a function of a complex variable. We experimentally study the complex dynamics of the Fibonacci numbers...
Clifford A. Reiter
ISBI
2006
IEEE
16 years 7 months ago
Statistics of populations of images and its embedded objects: driving applications in neuroimaging
Work in progress towards modeling shape statistics of multiobject complexes is presented. Constraints defined by the set of objects such as a compact representation of object shap...
Guido Gerig, Sarang C. Joshi, P. Thomas Fletcher, ...
PROMISE
2010
15 years 1 months ago
Replication of defect prediction studies: problems, pitfalls and recommendations
Background: The main goal of the PROMISE repository is to enable reproducible, and thus verifiable or refutable research. Over time, plenty of data sets became available, especial...
Thilo Mende