Sciweavers

2950 search results - page 20 / 590
» Computing with Infinitely Many Processes
Sort
View
CSCLP
2008
Springer
13 years 10 months ago
An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
Khalil Djelloul
MAM
2007
113views more  MAM 2007»
13 years 8 months ago
A reconfigurable computing framework for multi-scale cellular image processing
Cellular computing architectures represent an important class of computation that are characterized by simple processing elements, local interconnect and massive parallelism. Thes...
Reid B. Porter, Jan R. Frigo, Al Conti, Neal R. Ha...
CCS
2010
ACM
14 years 1 days ago
RunTest: assuring integrity of dataflow processing in cloud computing infrastructures
Cloud computing has emerged as a multi-tenant resource sharing platform, which allows different service providers to deliver software as services in an economical way. However, fo...
Juan Du, Wei Wei, Xiaohui Gu, Ting Yu
ICNP
1998
IEEE
14 years 1 months ago
On Reducing the Processing Cost of On-Demand QoS Path Computation
Quality of Service (QoS) routing algorithms have become the focus of recent research due to their potential for increasing the utilization of an Integrated Services Packet Network...
George Apostolopoulos, Satish K. Tripathi
ICCV
2007
IEEE
14 years 10 months ago
Webcam Synopsis: Peeking Around the World
The world is covered with millions of webcams. Some are private, but many transmit everything in their field of view over the internet 24 hours a day. A web search finds public we...
Yael Pritch, Alex Rav-Acha, Avital Gutman, Shmuel ...