Sciweavers

723 search results - page 37 / 145
» Reducing the complexity of the issue logic
Sort
View
ICSEA
2007
IEEE
14 years 1 months ago
DEUCE : Separating Concerns in User Interfaces
—As current software systems evolve continuously, both the application and its user interface (UI) have to be adapted. However, UI code is often scattered through and entangled w...
Sofie Goderis, Dirk Deridder, Ellen Van Paesschen
AAAI
2007
13 years 10 months ago
Logical Generative Models for Probabilistic Reasoning about Existence, Roles and Identity
In probabilistic reasoning, the problems of existence and identity are important to many different queries; for example, the probability that something that fits some description...
David Poole
FUIN
2010
116views more  FUIN 2010»
13 years 5 months ago
An Investigation of Multi-Agent Planning in CLP
This paper explores the use of Constraint Logic Programming (CLP) as a platform for experimenting with planning problems in the presence of multiple interacting agents. The paper ...
Agostino Dovier, Andrea Formisano, Enrico Pontelli
DAC
2010
ACM
13 years 8 months ago
Detecting tangled logic structures in VLSI netlists
This work proposes a new problem of identifying large and tangled logic structures in a synthesized netlist. Large groups of cells that are highly interconnected to each other can...
Tanuj Jindal, Charles J. Alpert, Jiang Hu, Zhuo Li...
MST
2008
141views more  MST 2008»
13 years 7 months ago
From a Zoo to a Zoology: Towards a General Theory of Graph Polynomials
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...
Johann A. Makowsky