Sciweavers

4378 search results - page 167 / 876
» On the Complexity of Ordered Colourings
Sort
View
AGP
2003
IEEE
15 years 11 months ago
Enhancing Disjunctive Logic Programming for Ontology Specification
This paper is a presentation of ONTO-DLP, an extension of Disjunctive Logic Programming (DLP) for complex knowledge modelling. ONTO-DLP enhances DLP by constructs coming from othe...
Francesco Calimeri, Stefania Galizia, Massimo Ruff...
COCO
2001
Springer
154views Algorithms» more  COCO 2001»
15 years 11 months ago
Quantum Algorithms for Element Distinctness
We present several applications of quantum amplitude amplification to finding claws and collisions in ordered or unordered functions. Our algorithms generalize those of Brassard...
Harry Buhrman, Christoph Dürr, Mark Heiligman...
SIGCOMM
1998
ACM
15 years 10 months ago
Accelerated Reliability Analysis for Self-Healing SONET Networks
Recently, a parametric State Reward Markov Model SRMM p has been developed for the reliability and availability analysis of self-healing SONET mesh networks 2 . In this paper, w...
Hakki C. Cankaya, V. S. S. Nair
ACE
2004
258views Education» more  ACE 2004»
15 years 8 months ago
Using a Maze Case Study to Teach Object-Oriented Programming and Design Patterns
In order to teach object-oriented design and programming in introductory computer science it is imperative to teach objects from the very beginning of the course. The use of inter...
Chris Nevison, Barbara Wells
IJCAI
1989
15 years 7 months ago
Domain Dependence in Parallel Constraint Satisfaction
We describe a general technique for expressing domain knowledge in constraint satisfaction problems, and using it to develop optimized parallel arc consistency algorithms for the ...
Paul R. Cooper, Michael J. Swain