Sciweavers

7123 search results - page 1105 / 1425
» The Ordered Set of Rough Sets
Sort
View
DPD
2008
136views more  DPD 2008»
15 years 6 months ago
A cache invalidation scheme for continuous partial match queries in mobile computing environments
The continuous partial match query is a partial match query whose result remains consistently in the client's memory. Conventional cache invalidation methods for mobile client...
Yon Dohn Chung
ECCC
2008
108views more  ECCC 2008»
15 years 6 months ago
The Complexity of Rationalizing Matchings
Given a set of observed economic choices, can one infer preferences and/or utility functions for the players that are consistent with the data? Questions of this type are called r...
Shankar Kalyanaraman, Christopher Umans
EJC
2008
15 years 6 months ago
On tension-continuous mappings
Tension-continuous (shortly TT) mappings are mappings between the edge sets of graphs. They generalize graph homomorphisms. From another perspective, tension-continuous mappings a...
Jaroslav Nesetril, Robert Sámal
ENTCS
2008
120views more  ENTCS 2008»
15 years 6 months ago
Specifying and Executing Reactive Scenarios With Lutin
This paper presents the language Lutin and its operational semantics. This language specifically targets the domain of reactive systems, where an execution is a (virtually) infini...
Pascal Raymond, Yvan Roux, Erwan Jahier
ENTCS
2008
102views more  ENTCS 2008»
15 years 6 months ago
Soft Linear Logic and Polynomial Complexity Classes
We describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem of second-order linear logic with restricted rules for exponentials, correct and co...
Marco Gaboardi, Jean-Yves Marion, Simona Ronchi De...
« Prev « First page 1105 / 1425 Last » Next »