Sciweavers

FOCS
2008
IEEE
13 years 9 months ago
Minimizing Movement in Mobile Facility Location Problems
In the mobile facility location problem, which is a variant of the classical Uncapacitated Facility Location and kMedian problems, each facility and client is assigned to a start ...
Zachary Friggstad, Mohammad R. Salavatipour
FOCS
2008
IEEE
13 years 9 months ago
A Dichotomy Theorem for the Resolution Complexity of Random Constraint Satisfaction Problems
We consider random instances of constraint satisfaction problems where each variable has domain size O(1), each constraint is on O(1) variables and the constraints are chosen from...
Siu On Chan, Michael Molloy
DLT
2008
13 years 9 months ago
On the Size Complexity of Rotating and Sweeping Automata
We examine the succinctness of one-way, rotating, sweeping, and two-way deterministic finite automata (1dfas, rdfas, sdfas, 2dfas). Here, a sdfa is a 2dfa whose head can change di...
Christos A. Kapoutsis, Richard Královic, To...
DIS
2008
Springer
13 years 9 months ago
Empirical Asymmetric Selective Transfer in Multi-objective Decision Trees
We consider learning tasks where multiple target variables need to be predicted. Two approaches have been used in this setting: (a) build a separate single-target model for each ta...
Beau Piccart, Jan Struyf, Hendrik Blockeel
GG
2010
Springer
13 years 9 months ago
A Component Concept for Typed Graphs with Inheritance and Containment Structures
Model-driven development (MDD) has become a promising trend in software engineering. The model-driven development of highly complex software systems may lead to large models which ...
Stefan Jurack, Gabriele Taentzer
GG
2010
Springer
13 years 9 months ago
Multi-Amalgamation in Adhesive Categories
Abstract. Amalgamation is a well-known concept for graph transformations in order to model synchronized parallelism of rules with shared subrules and corresponding transformations....
Ulrike Golas, Hartmut Ehrig, Annegret Habel
GG
2010
Springer
13 years 9 months ago
On the Computation of McMillan's Prefix for Contextual Nets and Graph Grammars
In recent years, a research thread focused on the use of the unfolding semantics for verification purposes. This started with a paper by McMillan, which devises an algorithm for co...
Paolo Baldan, Alessandro Bruni, Andrea Corradini, ...
GG
2010
Springer
13 years 9 months ago
A Hoare Calculus for Graph Programs
el of abstraction). Refereed Conference and Workshop Papers
Christopher M. Poskitt, Detlef Plump
GG
2010
Springer
13 years 9 months ago
Local Confluence for Rules with Nested Application Conditions
Abstract. Local confluence is an important property in many rewriting and transformation systems. The notion of critical pairs is central for being able to verify local confluence ...
Hartmut Ehrig, Annegret Habel, Leen Lambers, Ferna...