Sciweavers

1705 search results - page 88 / 341
» Representing Constraints with Automata
Sort
View
AIMSA
2004
Springer
14 years 3 months ago
Exploiting the Constrainedness in Constraint Satisfaction Problems
Nowadays, many real problem in Artificial Intelligence can be modeled as constraint satisfaction problems (CSPs). A general rule in constraint satisfaction is to tackle the hardes...
Miguel A. Salido, Federico Barber
JAIR
2000
105views more  JAIR 2000»
13 years 10 months ago
Reasoning on Interval and Point-based Disjunctive Metric Constraints in Temporal Contexts
We introduce a temporal model for reasoning on disjunctive metric constraints on intervals and time points in temporal contexts. This temporal model is composed of a labeled tempo...
Federico Barber
WADS
2007
Springer
130views Algorithms» more  WADS 2007»
14 years 4 months ago
Approximating the Maximum Sharing Problem
In the maximum sharing problem (MS), we want to compute a set of (non-simple) paths in an undirected bipartite graph covering as many nodes as possible of the first layer of the ...
Amitabh Chaudhary, Danny Z. Chen, Rudolf Fleischer...
ICTCS
2005
Springer
14 years 3 months ago
Checking Risky Events Is Enough for Local Policies
Abstract. An extension of the λ-calculus is proposed to study historybased access control. It allows for parametrized security policies with a possibly nested, local scope. To gov...
Massimo Bartoletti, Pierpaolo Degano, Gian Luigi F...
VL
1994
IEEE
159views Visual Languages» more  VL 1994»
14 years 2 months ago
Interaction in Really Graphical User Interfaces
Employing diagrams in the UI causes problems that don't exist in so called Graphical User Interfaces. We are implementing a tool for generating editors for a certain class of...
Gerhard Viehstaedt, Mark Minas