64 search results - page 10 / 13 » Exact Elimination of Cycles in Graphs |
WIOPT
2010
IEEE
13 years 5 months ago
2010
IEEE
—Opportunistic forwarding is a simple scheme for packet routing in ad hoc wireless networks such as duty cycling sensor networks in which reducing energy consumption is a princip...
WG
1994
Springer
13 years 11 months ago
1994
Springer
The goal of a fugitive-search game on a graph is to trap a fugitive that hides on the vertices of the graph by systematically placing searchers on the vertices. The fugitive is as...
SPAA
2006
ACM
14 years 1 months ago
2006
ACM
Synchronization is often necessary in parallel computing, but it can create delays whenever the receiving processor is idle, waiting for the information to arrive. This is especia...
ASPDAC
2008
ACM
13 years 9 months ago
2008
ACM
We propose REWIRED (REgister Write Inhibition by REsource Dedication), a technique for reducing power during high level synthesis (HLS) by selectively inhibiting the storage of fun...
KR
2004
Springer
14 years 22 days ago
2004
Springer
One of the major advances in classical planning has been the development of Graphplan. Graphplan builds a layered structure called the planning graph, and then searches this struc...