2845 search results - page 240 / 569 » Constraints over Ontologies |
152
Voted
DSD
2007
IEEE
16 years 13 days ago
2007
IEEE
Synchronous Data Flow Graphs (SDFGs) are a very useful means for modeling and analyzing streaming applications. Some performance indicators, such as throughput, have been studied b...
156
click to vote
ECOOP
2004
Springer
15 years 11 months ago
2004
Springer
Many compiler optimizations and software engineering tools need precise pointer analyses to be effective. Unfortunately, many Java features, such as dynamic class loading, refle...
165
click to vote
KR
2004
Springer
15 years 11 months ago
2004
Springer
We consider complex scheduling problems that can be captured as optimization under hard and soft constraints. The objective of such an optimization problem is to satisfy as many h...
164
Voted
CONCUR
2000
Springer
15 years 10 months ago
2000
Springer
Model checking based on the causal partial order semantics of Petri nets is an approach widely applied to cope with the state space explosion problem. One of the ways to exploit su...
162
click to vote
CP
2000
Springer
15 years 10 months ago
2000
Springer
Most of complete search algorithms over Constraint Satisfaction Problems (csp) are based on Standard Backtracking. Two main enhancements of this basic scheme have been proposed : r...