Sciweavers

952 search results - page 141 / 191
» Computational complexity of stochastic programming problems
Sort
View
CP
1997
Springer
15 years 7 months ago
Ordering Constraints over Feature Trees
Feature trees have been used to accommodate records in constraint programming and record like structures in computational linguistics. Feature trees model records, and feature cons...
Martin Müller, Joachim Niehren, Andreas Podel...
TDSC
2008
152views more  TDSC 2008»
15 years 3 months ago
Towards Formal Verification of Role-Based Access Control Policies
Specifying and managing access control policies is a challenging problem. We propose to develop formal verification techniques for access control policies to improve the current s...
Somesh Jha, Ninghui Li, Mahesh V. Tripunitara, Qih...
ICRA
2006
IEEE
131views Robotics» more  ICRA 2006»
15 years 9 months ago
Proximity Queries between Convex Objects: an Interior Point Approach for Implicit Surfaces
— This paper presents an interior point approach to exact distance computation between convex objects represented as intersections of implicit surfaces. Exact distance computatio...
Nilanjan Chakraborty, Jufeng Peng, Srinivas Akella...
ICLP
2005
Springer
15 years 8 months ago
OWL: A Description Logic Based Ontology Language
Abstract Description Logics (DLs) are a family of class (concept) based knowledge representation formalisms. They are characterised by the use of various constructors to build comp...
Ian Horrocks
ACE
2003
180views Education» more  ACE 2003»
15 years 4 months ago
Managing the managers: Collaborative virtual teams with large staff and student numbers
Virtual teaming involving online presentations and peer reviews support the notion of collaborative student learning, whilst preparing them for the virtual work environment. Howev...
Kathy Egea