Sciweavers

4513 search results - page 618 / 903
» Logic programming with satisfiability
Sort
View
STOC
2004
ACM
109views Algorithms» more  STOC 2004»
16 years 4 months ago
Approximating the cut-norm via Grothendieck's inequality
The cut-norm ||A||C of a real matrix A = (aij)iR,jS is the maximum, over all I R, J S of the quantity | iI,jJ aij|. This concept plays a major role in the design of efficient app...
Noga Alon, Assaf Naor
SOFSEM
2010
Springer
16 years 1 months ago
Finding and Certifying Loops
Abstract. The first part of this paper presents a new approach for automatically proving nontermination of string rewrite systems. We encode rewrite sequences as propositional for...
Harald Zankl, Christian Sternagel, Dieter Hofbauer...
ECBS
2009
IEEE
105views Hardware» more  ECBS 2009»
15 years 11 months ago
A Framework for Developing Feature-Rich Software Systems
In response to changing requirements and other environmental influences, software systems are increasingly developed incrementally. Successful implementation of new features in e...
Thein Than Tun, Rod Chapman, Charles B. Haley, Rob...
WECWIS
2009
IEEE
162views ECommerce» more  WECWIS 2009»
15 years 11 months ago
QoS-Driven Web Service Composition Using Learning-Based Depth First Search
—The goal of the Web Service Composition (WSC) problem is to find an optimal composition of web services to satisfy a given request using their syntactic and/or semantic feature...
Wonhong Nam, Hyunyoung Kil, Jungjae Lee
ERSHOV
2009
Springer
15 years 10 months ago
Standardization and Testing of Mathematical Functions
Abstract. The article concerns problems of formulating standard requirements to implementations of mathematical functions working with floating-point numbers and conformance test ...
Victor V. Kuliamin