Sciweavers

2517 search results - page 268 / 504
» Specifying Weak Sets
Sort
View
GG
2010
Springer
15 years 6 months ago
Verification of Graph Transformation Systems with Context-Free Specifications
We introduce an analysis method for graph transformation systems which checks that certain forbidden graphs are not reachable from the start graph. These forbidden graphs are speci...
Barbara König, Javier Esparza
AI
2008
Springer
15 years 6 months ago
The measurement of ranks and the laws of iterated contraction
: Ranking theory delivers an account of iterated contraction; each ranking function induces a specific iterated contraction behavior. The paper shows how to reconstruct a ranking f...
Matthias Hild, Wolfgang Spohn
CORR
2010
Springer
62views Education» more  CORR 2010»
15 years 6 months ago
Information embedding meets distributed control
We consider the problem of information embedding where the encoder modifies a white Gaussian host signal in a power-constrained manner to encode the message, and the decoder recov...
Pulkit Grover, Aaron B. Wagner, Anant Sahai
173
Voted
DKE
2010
134views more  DKE 2010»
15 years 6 months ago
Combining ontological profiles with context in information retrieval
An ontology is a formal conceptualization of a domain, specifying the concepts of the domain and the relations between them. It is however not a straight forward task to use this ...
Geir Solskinnsbakk, Jon Atle Gulla
AMC
2006
115views more  AMC 2006»
15 years 6 months ago
A memetic algorithm for a vehicle routing problem with backhauls
This paper considers an extension of a vehicle routing problem with backhauls (VRPB). In this problem, a set of costumers are divided in two subsets consisting of linehaul and bac...
Reza Tavakkoli-Moghaddam, A. R. Saremi, M. S. Ziae...