Sciweavers

723 search results - page 119 / 145
» Computationally Efficient Transductive Machines
Sort
View
CONCUR
2006
Springer
13 years 11 months ago
Minimization, Learning, and Conformance Testing of Boolean Programs
Boolean programs with recursion are convenient abstractions of sequential imperative programs, and can be represented as recursive state machines (RSMs) or pushdown automata. Motiv...
Viraj Kumar, P. Madhusudan, Mahesh Viswanathan
CF
2008
ACM
13 years 9 months ago
Fpga-based prototype of a pram-on-chip processor
PRAM (Parallel Random Access Model) has been widely regarded a desirable parallel machine model for many years, but it is also believed to be "impossible in reality." As...
Xingzhi Wen, Uzi Vishkin
NSDI
2010
13 years 9 months ago
Hedera: Dynamic Flow Scheduling for Data Center Networks
Today's data centers offer tremendous aggregate bandwidth to clusters of tens of thousands of machines. However, because of limited port densities in even the highest-end swi...
Mohammad Al-Fares, Sivasankar Radhakrishnan, Barat...
CCGRID
2010
IEEE
13 years 8 months ago
Cooperative Multitasking for GPU-Accelerated Grid Systems
Exploiting the graphics processing unit (GPU) is useful to obtain higher performance with a less number of host machines in grid systems. One problem in GPU-accelerated grid system...
Fumihiko Ino, Akihiro Ogita, Kentaro Oita, Kenichi...
TSC
2008
140views more  TSC 2008»
13 years 7 months ago
Dynamic Web Service Selection for Reliable Web Service Composition
This paper studies the dynamic Web service selection problem in a failure-prone environment, which aims to determine a subset of Web services to be invoked at runtime so as to succ...
San-Yih Hwang, Ee-Peng Lim, Chien-Hsiang Lee, Chen...