Sciweavers

461 search results - page 75 / 93
» Component-Based Answer Set Programming
Sort
View
FUIN
2010
109views more  FUIN 2010»
13 years 8 months ago
Combinatorial Optimization Solutions for the Maximum Quartet Consistency Problem
Given a set of taxa S and a complete set of quartet topologies Q over S, the problem of determining a phylogeny that satisfies the maximum number of topologies is called the Maxi...
António Morgado, João Marques-Silva
CDC
2010
IEEE
155views Control Systems» more  CDC 2010»
13 years 5 months ago
Relaxing LMI domination matricially
Given linear matrix inequalities (LMIs) L1 and L2 in the same number of variables it is natural to ask: (Q1) does one dominate the other, that is, does L1(X) 0 imply L2(X) 0? (Q2) ...
J. William Helton, Igor Klep, Scott A. McCullough
ANLP
2000
149views more  ANLP 2000»
13 years 11 months ago
Javox: A Toolkit for Building Speech-Enabled Applications
JAVOX provides a mechanism for the development of spoken-language systems from existing desktop applications. We present an architecture that allows existing Java1 programs to be ...
Michael S. Fulkerson, Alan W. Biermann
TPLP
2002
117views more  TPLP 2002»
13 years 9 months ago
On Properties of Update Sequences Based on Causal Rejection
In this paper, we consider an approach to update nonmonotonic knowledge bases represented as extended logic programs under the answer set semantics. In this approach, new informat...
Thomas Eiter, Michael Fink, Giuliana Sabbatini, Ha...
CPAIOR
2009
Springer
14 years 4 months ago
Solution Enumeration for Projected Boolean Search Problems
Many real-world problems require the enumeration of all solutions of combinatorial search problems, even though this is often infeasible in practice. However, not always all parts ...
Martin Gebser, Benjamin Kaufmann, Torsten Schaub