Sciweavers

5180 search results - page 786 / 1036
» Concurrency, Time, and Constraints
Sort
View
FOCS
1992
IEEE
15 years 10 months ago
Efficient Inference of Partial Types
Partial types for the -calculus were introduced by Thatte in 1988 [3] as a means of typing objects that are not typable with simple types, such as heterogeneous lists and persiste...
Dexter Kozen, Jens Palsberg, Michael I. Schwartzba...
APPROX
2006
Springer
162views Algorithms» more  APPROX 2006»
15 years 10 months ago
Approximating Precedence-Constrained Single Machine Scheduling by Coloring
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
Christoph Ambühl, Monaldo Mastrolilli, Ola Sv...
CARDIS
2006
Springer
114views Hardware» more  CARDIS 2006»
15 years 10 months ago
A Low-Footprint Java-to-Native Compilation Scheme Using Formal Methods
Ahead-of-Time and Just-in-Time compilation are common ways to improve runtime performances of restrained systems like Java Card by turning critical Java methods into native code. H...
Alexandre Courbot, Mariela Pavlova, Gilles Grimaud...
CSCLP
2006
Springer
15 years 10 months ago
Distributed Forward Checking May Lie for Privacy
DisFC is an ABT-like algorithm that, instead of sending the value taken by the high priority agent, it sends the domain of the low priority agent that is compatible with that value...
Ismel Brito, Pedro Meseguer
MFCS
1995
Springer
15 years 10 months ago
Graph Inference from a Walk for TRees of Bounded Degree 3 is NP-Complete
The graph inference from a walk for a class C of undirected edge-colored graphs is, given a string x of colors, nding the smallest graph G in C that allows a traverse of all edge...
Osamu Maruyama, Satoru Miyano