1952 search results - page 305 / 391 » Complete partitions of graphs |
165
click to vote
AAAI
2007
15 years 7 months ago
2007
We present in this paper a hybrid planning system which combines constraint satisfaction techniques and planning heuristics to produce optimal sequential plans. It integrates its ...
133
click to vote
CDC
2008
IEEE
15 years 6 months ago
2008
IEEE
In this paper, we develop an automated framework for formal verification of timed continuous Petri nets (contPN). Specifically, we consider two problems: (1) given an initial set o...
125
click to vote
SERP
2008
15 years 6 months ago
2008
Model-driven development (MDD) is an emerging paradigm and has become state-of-the-art for embedded systems software design. In the overall design process, several steps have to be...
141
click to vote
SODA
2008
ACM
15 years 6 months ago
2008
ACM
Greedy Routing is a class of routing algorithms in which the packets are forwarded in a manner that reduces the distance to the destination at every step. In an attempt to provide...
140
click to vote
APVIS
2003
15 years 6 months ago
2003
High cohesion, or module strength, indicates that a system has been well partitioned into components which have strong internal relationships. An understanding of cohesion is an i...