Sciweavers

3172 search results - page 58 / 635
» On the Random-Self-Reducibility of Complete Sets
Sort
View
CHI
1994
ACM
15 years 4 months ago
A groupware environment for complete meetings
1 A virtual meeting room is the electronic place where meetings actually occur, and collects people, tools, and computer agents into a desktop conference. Meetings have different ...
Ted O'Grady, Saul Greenberg
CAV
2010
Springer
214views Hardware» more  CAV 2010»
15 years 4 months ago
Comfusy: A Tool for Complete Functional Synthesis
Synthesis of program fragments from specifications can make programs easier to write and easier to reason about. We present Comfusy, a tool that extends the compiler for the gener...
Viktor Kuncak, Mikaël Mayer, Ruzica Piskac, P...
113
Voted
APN
2006
Springer
15 years 4 months ago
Complete Finite Prefixes of Symbolic Unfoldings of Safe Time Petri Nets
Abstract. Time Petri nets have proved their interest in modeling realtime concurrent systems. Their usual semantics is defined in term of firing sequences, which can be coded in a ...
Thomas Chatain, Claude Jard
ESA
2010
Springer
203views Algorithms» more  ESA 2010»
15 years 1 months ago
A Complete Characterization of Group-Strategyproof Mechanisms of Cost-Sharing
Abstract. We study the problem of designing group-strategyproof costsharing mechanisms. The players report their bids for getting serviced and the mechanism decides a set of player...
Emmanouil Pountourakis, Angelina Vidali
FPGA
1998
ACM
142views FPGA» more  FPGA 1998»
15 years 5 months ago
A Hybrid Complete-Graph Partial-Crossbar Routing Architecture for Multi-FPGA Systems
Multi-FPGA systems (MFSs) are used as custom computing machines, logic emulators and rapid prototyping vehicles. A key aspect of these systems is their programmable routing archit...
Mohammed A. S. Khalid, Jonathan Rose