Sciweavers

7167 search results - page 596 / 1434
» Answer Set Programming
Sort
View
CPHYSICS
2006
182views more  CPHYSICS 2006»
15 years 6 months ago
MinFinder: Locating all the local minima of a function
A new stochastic clustering algorithm is introduced that aims to locate all the local minima of a multidimensional continuous and differentiable function inside a bounded domain. ...
Ioannis G. Tsoulos, Isaac E. Lagaris
DCC
2004
IEEE
16 years 5 months ago
Some Indecomposable t-Designs
The existence of large sets of 5-(14,6,3) designs is in doubt. There are five simple 5-(14,6,6) designs known in the literature. In this note, by the use of a computer program, we...
Gholamreza B. Khosrovshahi, Behruz Tayfeh-Rezaie
ACMMPC
2000
Springer
231views Mathematics» more  ACMMPC 2000»
15 years 10 months ago
Galois Connections and Fixed Point Calculus
Fixed point calculus is about the solution of recursive equations de˛ned by a monotonic endofunction on a partially ordered set. This tutorial presents the basic theory of ˛xed ...
Roland Carl Backhouse
ICCAD
1999
IEEE
99views Hardware» more  ICCAD 1999»
15 years 10 months ago
Concurrent logic restructuring and placement for timing closure
: In this paper, an algorithm for simultaneous logic restructuring and placement is presented. This algorithm first constructs a set of super-cells along the critical paths and the...
Jinan Lou, Wei Chen, Massoud Pedram
SIAMCOMP
2008
95views more  SIAMCOMP 2008»
15 years 6 months ago
On the Algorithmic Aspects of Discrete and Lexicographic Helly-Type Theorems and the Discrete LP-Type Model
Helly's theorem says that, if every d+1 elements of a given finite set of convex objects in Rd have a common point, there is a point common to all of the objects in the set. I...
Nir Halman