Sciweavers

16404 search results - page 750 / 3281
» A set coverage problem
Sort
View
EPIA
2007
Springer
16 years 1 months ago
GRASPER
In this paper we present GRASPER, a graph constraint solver, based on set constraints. We specify GRASPER’s constraints and we make use of our framework to model a problem in the...
Ruben Duarte Viegas, Francisco Azevedo
IJCNN
2006
IEEE
16 years 1 months ago
Nominal-scale Evolving Connectionist Systems
— A method is presented for extending the Evolving Connectionist System (ECoS) algorithm that allows it to explicitly represent and learn nominal-scale data without the need for ...
Michael J. Watts
PASTE
2004
ACM
16 years 27 days ago
Resolving and applying constraint queries on context-sensitive analyses
A context-sensitive analysis is an analysis in which program elements are assigned sets of properties that depend upon the context in which they occur. For analyses on imperative ...
James Ezick
ESA
2004
Springer
95views Algorithms» more  ESA 2004»
16 years 26 days ago
An Improved Algorithm for CIOQ Switches
Abstract. The problem of maximizing the weighted throughput in various switching settings has been intensively studied recently through competitive analysis. To date, the most gene...
Yossi Azar, Yossi Richter
COMPGEOM
1999
ACM
15 years 11 months ago
The Path of a Triangulation
We define the path of a pseudo-triangulation, a data structure generalizing the path of a triangulation of a point set. This structure allows us to use divide-andconquer type of ...
Oswin Aichholzer