14360 search results - page 2765 / 2872 » Time Modeling in MARTE |
211
click to vote
CONCUR
2005
Springer
15 years 12 months ago
2005
Springer
d Abstract) Vijay Saraswat1 and Radha Jagadeesan2 1 IBM T.J. Watson Research Lab 2 School of CTI, DePaul University Abstract. We present the concurrency and distribution primitives...
182
click to vote
CP
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. Most CSP algorithms are based on refinements and extensions of backtracking, and employ one of two simple “branching schemes”: 2-way branching or d-way branching, fo...
193
click to vote
ER
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. Understanding a large schema without the assistance of persons already familiar with it (and its associated applications), is a hard and very time consuming task that occ...
153
click to vote
EUROCAST
2005
Springer
15 years 12 months ago
2005
Springer
abstract NP-hard optimization problem, in a general sense. From the observation that, intuitively, there are many connections among categorical concepts and structural complexity n...
202
click to vote
FM
2005
Springer
15 years 12 months ago
2005
Springer
Abstract Colin Campbell, Wolfgang Grieskamp, Lev Nachmanson, Wolfram Schulte, Nikolai Tillmann, and Margus Veanes Microsoft Research, Redmond, WA, USA Abstract. We describe a pract...