Sciweavers

3040 search results - page 212 / 608
» Independent Natural Extension
Sort
View
APPROX
2009
Springer
142views Algorithms» more  APPROX 2009»
15 years 7 months ago
Truthful Mechanisms via Greedy Iterative Packing
An important research thread in algorithmic game theory studies the design of efficient truthful mechanisms that approximate the optimal social welfare. A fundamental question is ...
Chandra Chekuri, Iftah Gamzu
89
Voted
FM
2009
Springer
124views Formal Methods» more  FM 2009»
15 years 7 months ago
An Incremental Approach to Scope-Bounded Checking Using a Lightweight Formal Method
We present a novel approach to optimize scope-bounded checking programs using a relational constraint solver. Given a program and its correctness specification, the traditional app...
Danhua Shao, Sarfraz Khurshid, Dewayne E. Perry
MODELS
2009
Springer
15 years 7 months ago
Weaving Variability into Domain Metamodels
A Domain-Specific Modeling Language (DSMLs) describes the concepts and their relationships of a particular domain, in a metamodel. Using a DSML, it is possible to describe a wide ...
Brice Morin, Gilles Perrouin, Philippe Lahire, Oli...
120
Voted
MODELS
2009
Springer
15 years 7 months ago
Towards Composite Model Transformations Using Distributed Graph Transformation Concepts
Model-based development of highly complex software systems leads to large models. Storing them in repositories offers the possibility to work with these models in a distributed env...
Stefan Jurack, Gabriele Taentzer
91
Voted
GLOBECOM
2006
IEEE
15 years 6 months ago
A Distributed Size-bounded Multi-hop Clustering for Mobile Ad Hoc Networks
— During the last few years there has been a rapid development in mobile ad hoc networks (MANETs). To make the operations of a MANET more efficient, one approach is to construct...
Yong Wang, Muralidhar Medidi