Proceedings, Volumes 1-2IEEE, 1999 - Artificial intelligence |
From inside the book
Results 1-3 of 54
Page 307
Next we present a more efficient algorithm based on graph theory . We first characterize feasible sequence in a live marked graph . Theorem 2 : Let ( N , M 。) be a live marked graph , then the solutions of the marking equation are ...
Next we present a more efficient algorithm based on graph theory . We first characterize feasible sequence in a live marked graph . Theorem 2 : Let ( N , M 。) be a live marked graph , then the solutions of the marking equation are ...
Page 344
... graph G uses colors 1 , ... , A + 1 and does not use colors greater than △ + 1 . A well - known chain recoloring technique for obtaining a A - coloring of a bipartite graph G can be used to prove the following Fact 2. Every optimal ...
... graph G uses colors 1 , ... , A + 1 and does not use colors greater than △ + 1 . A well - known chain recoloring technique for obtaining a A - coloring of a bipartite graph G can be used to prove the following Fact 2. Every optimal ...
Page 345
... graph G ; ( b ) graph G * ; ( c ) graph G ** Now we are ready to prove our negative result . Theorem 2.3 . The P \ fix ; = 2 , UET | EC , problem is NP- hard in the strong sense , even if the scheduling graph is subcubic bipartite ...
... graph G ; ( b ) graph G * ; ( c ) graph G ** Now we are ready to prove our negative result . Theorem 2.3 . The P \ fix ; = 2 , UET | EC , problem is NP- hard in the strong sense , even if the scheduling graph is subcubic bipartite ...
Contents
Java RealTime Distributed Processing Over ATM Networks with ChorusOS | 3 |
Optimizing Costs and Processing Times Under Variable External Processing | 4 |
A Petri Net Solution to the Problem of Deadlocks in Systems of Processes With | 8 |
Copyright | |
73 other sections not shown
Other editions - View all
Common terms and phrases
action activity actuators adaptive agent algorithm APDU applet application architecture Automation behavior byte camera client components Computer Vision configuration constraints control system CORBA cost defined described detected developed devices distributed dynamic environment error example execution feature Figure filter FPGA function fuzzy Genetic Algorithms graph hardware IEEE implementation industrial initial input integrated interface Java JavaCard laser Lonworks machine manipulator manufacturing system marked graph matrix method mobile robot module monitoring neural network nodes object obstacle obtained OpenCard Framework operations optimal output parameters PC/SC performance Petri net pixel position problem proposed real-time reinforcement learning rules scheduling sensor sequence server signal simulation smart card solution strategy structure Sun Microsystems task techniques terminal application tool trajectory transducers transition ultrasonic variables vector virtual visual VRML workflow