Sciweavers

305 search results - page 27 / 61
» A Logical Framework to Deal with Variability
Sort
View
CORR
2002
Springer
132views Education» more  CORR 2002»
14 years 11 months ago
Robust Feature Selection by Mutual Information Distributions
Mutual information is widely used in artificial intelligence, in a descriptive way, to measure the stochastic dependence of discrete random variables. In order to address question...
Marco Zaffalon, Marcus Hutter
ISSTA
2004
ACM
15 years 5 months ago
An optimizing compiler for batches of temporal logic formulas
Model checking based on validating temporal logic formulas has proven practical and effective for numerous software engineering applications. As systems based on this approach ha...
James Ezick
CC
2010
Springer
282views System Software» more  CC 2010»
14 years 10 months ago
Lower Bounds on the Randomized Communication Complexity of Read-Once Functions
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
Nikos Leonardos, Michael Saks
AAAI
2000
15 years 1 months ago
Asynchronous Search with Aggregations
Many problem-solving tasks can be formalized as constraint satisfaction problems (CSPs). In a multi-agent setting, information about constraints and variables may belong to differ...
Marius-Calin Silaghi, Djamila Sam-Haroud, Boi Falt...
EPIA
2003
Springer
15 years 5 months ago
jcc: Integrating Timed Default Concurrent Constraint Programming into Java
Abstract. This paper describes jcc, an integration of the timed default concurrent constraint programming framework [16] (Timed Default cc) into JAVA [7]. jcc is intended for use i...
Vijay A. Saraswat, Radha Jagadeesan, Vineet Gupta