Sciweavers

2907 search results - page 169 / 582
» Presentations of Structures in Admissible Sets
Sort
View
STOC
2007
ACM
181views Algorithms» more  STOC 2007»
16 years 6 months ago
How to rank with few errors
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...
Claire Kenyon-Mathieu, Warren Schudy
FOAL
2009
ACM
16 years 1 months ago
A type system for functional traversal-based aspects
We present a programming language model of the ideas behind Functional Adaptive Programming (AP-F) and our Java implementation, DemeterF. Computation in AP-F is encapsulated in se...
Bryan Chadwick, Karl J. Lieberherr
ACSC
2007
IEEE
16 years 26 days ago
The CRSS Metric for Package Design Quality
Package design is concerned with the determining the best way to partition the classes in a system into subsystems. A poor package design can adversely affect the quality of a sof...
Hayden Melton, Ewan D. Tempero
APN
2007
Springer
16 years 21 days ago
Theory of Regions for the Synthesis of Inhibitor Nets from Scenarios
In this paper we develop a theory for the region-based synthesis of system models given as place/transition-nets with weighted inhibitor arcs (ptinets) from sets of scenarios descr...
Robert Lorenz, Sebastian Mauser, Robin Bergenthum
CSCLP
2004
Springer
15 years 12 months ago
A Note on Bilattices and Open Constraint Programming
Abstract. We propose to use bilattice as a constraint valuation structure in order to represent truth and belief at the same time. A bilattice is a set which owns two lattices orde...
Arnaud Lallouet