Sciweavers

19003 search results - page 3673 / 3801
» We Need Assurance!
Sort
View
SYNASC
2006
IEEE
103views Algorithms» more  SYNASC 2006»
14 years 3 months ago
Incremental Deterministic Planning
We present a new planning algorithm that formulates the planning problem as a counting satisfiability problem in which the number of available solutions guides the planner determ...
Stefan Andrei, Wei-Ngan Chin, Martin C. Rinard
ACMSE
2006
ACM
14 years 3 months ago
Extensions to and optimization of a mobile computational system for internet programming
elow are abstracts of student-faculty collaborative work presented at regional, national, and international conferences. Gregory Adkins, Elizabeth Carter, Amanda Micai, and Sarah M...
Sarah Monisha Pulimood, Gregory Adkins, Elizabeth ...
CASES
2006
ACM
14 years 3 months ago
Scalable subgraph mapping for acyclic computation accelerators
Computer architects are constantly faced with the need to improve performance and increase the efficiency of computation in their designs. To this end, it is increasingly common ...
Nathan Clark, Amir Hormati, Scott A. Mahlke, Sami ...
CONEXT
2006
ACM
14 years 3 months ago
Migrating home agents towards internet-scale mobility deployments
While the IETF standardization process of the Mobile IPv6 and Network Mobility (NEMO) protocols is almost complete, their large-scale deployment is not yet possible. With these te...
Ryuji Wakikawa, Guillaume Valadon, Jun Murai
CSCW
2006
ACM
14 years 3 months ago
Improving network efficiency in real-time groupware with general message compression
Groupware communicates by sending messages across the network, and groupware programmers use a variety of formats for these messages, such as XML, plain text, or serialized object...
Carl Gutwin, Christopher Fedak, Mark Watson, Jeff ...
« Prev « First page 3673 / 3801 Last » Next »