Sciweavers

432 search results - page 30 / 87
» Open Problems with Part-Whole Relations
Sort
View
CORR
2007
Springer
113views Education» more  CORR 2007»
15 years 13 days ago
Geometry and the complexity of matrix multiplication
We survey results in algebraic complexity theory, focusing on matrix multiplication. Our goals are (i.) to show how open questions in algebraic complexity theory are naturally pose...
J. M. Landsberg
RITA
2006
81views more  RITA 2006»
15 years 11 days ago
Rastreabilidade de Requisitos
: Requirements traceability is central to the issue of requirements management, which is essential for producing quality software. Our focus on requirements traceability addresses ...
Miriam Sayão, Julio Cesar Sampaio do Prado ...
115
Voted
ICDT
2012
ACM
235views Database» more  ICDT 2012»
13 years 2 months ago
Equivalence and minimization of conjunctive queries under combined semantics
The problems of query containment, equivalence, and minimization are recognized as very important in the context of query processing, specifically of query optimization. In their...
Rada Chirkova
107
Voted
ICCBR
2003
Springer
15 years 5 months ago
Case-Based Ranking for Decision Support Systems
Abstract. Very often a planning problem can be formulated as a ranking problem: i.e. to find an order relation over a set of alternatives. The ranking of a finite set of alternat...
Paolo Avesani, Sara Ferrari, Angelo Susi
QEST
2007
IEEE
15 years 6 months ago
Symbolic Bisimulations for Probabilistic Systems
The paper introduces symbolic bisimulations for a simple probabilistic π-calculus to overcome the infinite branching problem that still exists in checking ground bisimulations b...
Peng Wu 0002, Catuscia Palamidessi, Huimin Lin