Sciweavers

98 search results - page 5 / 20
» The ROOTS Constraint
Sort
View
74
Voted
TCS
2010
14 years 8 months ago
On a special class of primitive words
When representing DNA molecules as words, it is necessary to take into account the fact that a word u encodes basically the same information as its Watson-Crick complement θ(u), w...
Elena Czeizler, Lila Kari, Shinnosuke Seki
SIAMCOMP
2008
108views more  SIAMCOMP 2008»
14 years 9 months ago
The Euclidean Orienteering Problem Revisited
We consider the rooted orienteering problem: Given a set P of n points in the plane, a starting point r P, and a length constraint B, one needs to find a path starting from r tha...
Ke Chen 0006, Sariel Har-Peled
104
Voted
CAISE
2004
Springer
15 years 1 months ago
Simple and Minimum-Cost Satisfiability for Goal Models
Abstract. Goal models have been used in Computer Science in order to represent software requirements, business objectives and design qualities. In previous work we have presented a...
Roberto Sebastiani, Paolo Giorgini, John Mylopoulo...
DLOG
2007
15 years 6 hour ago
Adding ABoxes to a Description Logic with Uniqueness Constraints via Path Agreements
We now know that the addition of a concept constructor called a Path Functional Dependency (PFD) to the Boolean-complete description logic DLF leads to undecidability of ABox consi...
Vitaliy L. Khizder, David Toman, Grant E. Weddell
TSP
2008
157views more  TSP 2008»
14 years 9 months ago
Sequential Monte Carlo Methods for Tracking Multiple Targets With Deterministic and Stochastic Constraints
In multitarget scenarios, kinematic constraints from the interaction of targets with their environment or other targets can restrict target motion. Such motion constraint informati...
Ioannis Kyriakides, Darryl Morrell, Antonia Papand...