Sciweavers

96 search results - page 7 / 20
» Ordering Constraints over Feature Trees
Sort
View
ICTAI
2003
IEEE
14 years 27 days ago
Approximate Discrete Probability Distribution Representation Using a Multi-Resolution Binary Tree
Computing and storing probabilities is a hard problem as soon as one has to deal with complex distributions over multiples random variables. The problem of efficient representati...
David Bellot, Pierre Bessière
DEXA
2010
Springer
182views Database» more  DEXA 2010»
13 years 7 months ago
Minimum Spanning Tree on Spatio-Temporal Networks
Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning t...
Viswanath Gunturi, Shashi Shekhar, Arnab Bhattacha...
COMPLEXITY
2004
165views more  COMPLEXITY 2004»
13 years 7 months ago
Sex promotes gamete selection: A quantitative comparative study of features favoring the evolution of sex
: Explaining the maintenance of sexual reproduction remains one of the greatest challenges in biology. The theoretical oddity of sex is based on at least three advantages that asex...
Klaus Jaffe
CSCLP
2008
Springer
13 years 9 months ago
An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
Khalil Djelloul
CP
2010
Springer
13 years 6 months ago
An Integrated Business Rules and Constraints Approach to Data Centre Capacity Management
A recurring problem in data centres is that the constantly changing workload is not proportionally distributed over the available servers. Some resources may lay idle while others ...
Roman van der Krogt, Jacob Feldman, James Little, ...