6693 search results - page 1003 / 1339 » On an anytime algorithm for control |
123
click to vote
FMSD
2006
15 years 3 months ago
2006
Two base algorithms are known for reachability verification over timed automata. They are called forward and backwards, and traverse the automata edges using either successors or p...
159
click to vote
CN
2007
15 years 3 months ago
2007
Although the ant metaphor has been successfully applied to routing of data packets both in wireless and fixed networks, little is known yet about its appropriateness for search i...
145
click to vote
COR
2007
15 years 3 months ago
2007
When the processing times of jobs are controllable, selected processing times affect both the manufacturing cost and the scheduling performance.A well-known example for such a cas...
134
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
We give a simple order-theoretic construction of a Cartesian closed category of sequential functions. It is based on bistable biorders, which are sets with a partial order — the ...
132
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
— The fairness of IEEE 802.11 wireless networks (including Wireless LAN and Ad-hoc networks) is hard to predict and control because of the randomness and complexity of the MAC co...