Sciweavers

2834 search results - page 146 / 567
» Representing Trees with Constraints
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
COLING
1992
13 years 11 months ago
Modularity, Parallelism, And Licensing In A Principle-Based Parser For German
This paper presents a direct implementation of Government-Binding theory in a parser for German, which faithfully models the modular structure of the theory. The modular design yi...
Sebastian Millies
ICIP
2001
IEEE
14 years 12 months ago
Feature coincidence trees for registration of ultrasound breast images
Registration of an image, the query or reference, to a database of rotated and translated exemplars constitutes an important image retrieval and indexing application which arises i...
Huzefa Neemuchwala, Alfred O. Hero, Paul L. Carson
HPCC
2007
Springer
14 years 4 months ago
Quantification of Cut Sequence Set for Fault Tree Analysis
A new evaluation method is presented that employs cut sequence set (CSS) to analyze fault trees. A cut sequence is a set of basic events that fail in a specific order that can indu...
Dong Liu, Chunyuan Zhang, Weiyan Xing, Rui Li, Hai...