2398 search results - page 180 / 480 » Constraint Programming and Graph Algorithms |
201
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
153
click to vote
JAIR
2010
15 years 4 months ago
2010
Call control features (e.g., call-divert, voice-mail) are primitive options to which users can subscribe off-line to personalise their service. The configuration of a feature su...
180
Voted
KBSE
1997
IEEE
15 years 10 months ago
1997
IEEE
In software testing, it is often desirable to find test inputs that exercise specific program features. To find these inputs by hand is extremely time-consuming, especially whe...
175
click to vote
DATE
2009
IEEE
16 years 1 months ago
2009
IEEE
—Scheduling task graphs under hard (end-to-end) timing constraints is an extensively studied NP-hard problem of critical importance for predictable software mapping on Multiproce...
163
click to vote
ISCAS
2005
IEEE
15 years 12 months ago
2005
IEEE
— Piecewise linear Lyapunov functions are used to design control gain matrices so that closed systems are robust stable and attractive regions are expanded as large as possible i...