Sciweavers

837 search results - page 31 / 168
» Hard combinators
Sort
View
86
Voted
CADE
2008
Springer
15 years 10 months ago
Proving Bounds on Real-Valued Functions with Computations
Interval-based methods are commonly used for computing numerical bounds on expressions and proving inequalities on real numbers. Yet they are hardly used in proof assistants, as th...
Guillaume Melquiond
STOC
2004
ACM
109views Algorithms» more  STOC 2004»
15 years 10 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
CEC
2009
IEEE
15 years 5 months ago
Modelling and simulation of granuloma formation in visceral leishmaniasis
— Visceral leishmaniasis is a parasitic disease that is usually fatal if untreated. Host resistance is thought to involve the accumulation of inflammatory cells into structures ...
Anton J. Flugge, Jon Timmis, Paul S. Andrews, John...
IPPS
2009
IEEE
15 years 4 months ago
Early experiences on accelerating Dijkstra's algorithm using transactional memory
In this paper we use Dijkstra’s algorithm as a challenging, hard to parallelize paradigm to test the efficacy of several parallelization techniques in a multicore architecture....
Nikos Anastopoulos, Konstantinos Nikas, Georgios I...
82
Voted
ISPW
2009
IEEE
15 years 4 months ago
Software Product Quality: Ensuring a Common Goal
: Software qualities are in many cases tacit and hard to measure. Thus, there is a potential risk that they get lower priority than deadlines, cost and functionality. This paper pr...
Sebastian Barney, Claes Wohlin