Sciweavers

436 search results - page 11 / 88
» Decomposing constraint systems: equivalences and computation...
Sort
View
AMAI
1999
Springer
13 years 8 months ago
STCSP - Structured Temporal Constraint satisfaction Problems
Temporal Constraint Satisfaction Problems (TCSP) is a well known approach for representing and processing temporal knowledge. Important properties of the knowledge can be inferred...
Mira Balaban, Tzachi Rosen
ICC
2007
IEEE
14 years 2 months ago
Wireless Packet Scheduling With Soft Deadlines
— We address the problem of scheduling multiple traffic streams associated with target profiles on a shared wireless link, arising in real-time applications with soft/flexible...
Aditya Dua, Nicholas Bambos
ECEASST
2008
121views more  ECEASST 2008»
13 years 8 months ago
Analyzing Semantic Properties of OCL Operations by Uncovering Interoperational Relationships
The OCL (Object Constraint Language) as part of the UML (Unified Modeling Language) is a rich language with different collection kinds (sets, multi-sets, sequences) and a large var...
Mirco Kuhlmann, Martin Gogolla
SMA
2005
ACM
109views Solid Modeling» more  SMA 2005»
14 years 2 months ago
Numerical decomposition of geometric constraints
Geometric constraint solving is a key issue in CAD/CAM. Since Owen’s seminal paper, solvers typically use graph based decomposition methods. However, these methods become diffi...
Sebti Foufou, Dominique Michelucci, Jean-Paul Jurz...
ISTCS
1993
Springer
14 years 20 days ago
Analog Computation Via Neural Networks
We pursue a particular approach to analog computation, based on dynamical systems of the type used in neural networks research. Our systems have a xed structure, invariant in time...
Hava T. Siegelmann, Eduardo D. Sontag