Sciweavers

4004 search results - page 28 / 801
» How Many Packets Can We Encode
Sort
View
CONCUR
2009
Springer
14 years 4 months ago
Encoding Asynchronous Interactions Using Open Petri Nets
Abstract. We present an encoding for (bound) processes of the asynchronous CCS with replication into open Petri nets: ordinary Petri nets equipped with a distinguished set of open ...
Paolo Baldan, Filippo Bonchi, Fabio Gadducci
AIPS
2000
13 years 11 months ago
Investigating the Effect of Relevance and Reachability Constraints on SAT Encodings of Planning
Currently, Graphplan and Blackbox, which converts Graphplan's plan graph into the satisfaction (SAT) problem, are two of the most successful planners. Since Graphplan gains i...
Minh Binh Do, Biplav Srivastava, Subbarao Kambhamp...
ICANN
2011
Springer
13 years 1 months ago
Transforming Auto-Encoders
The artificial neural networks that are used to recognize shapes typically use one or more layers of learned feature detectors that produce scalar outputs. By contrast, the comput...
Geoffrey E. Hinton, Alex Krizhevsky, Sida D. Wang
APGV
2010
ACM
328views Visualization» more  APGV 2010»
13 years 11 months ago
Can I pass?: using affordances to measure perceived size in virtual environments
Perception of an accurate sense of the scale depicted in computer graphics is important for many applications. How to best characterize the accuracy of space perception in compute...
Michael Geuss, Jeanine Stefanucci, Sarah H. Creem-...
ANCS
2006
ACM
14 years 3 months ago
Localized asynchronous packet scheduling for buffered crossbar switches
Buffered crossbar switches are a special type of crossbar switches. In such a switch, besides normal input queues and output queues, a small buffer is associated with each crosspo...
Deng Pan, Yuanyuan Yang