Sciweavers

19700 search results - page 178 / 3940
» DNA-Based Computation Times
Sort
View
COMPUTER
2002
65views more  COMPUTER 2002»
15 years 5 months ago
E-Business Process Modeling: The Next Big Step
abstract service descriptions to specific physical addresses such as HTTP or SMTP statically at design time or dynamically at runtime.
Selim Aissi, Pallavi Malu, Krishnamurthy Srinivasa...
ICPP
1995
IEEE
15 years 8 months ago
Sorting and Selection on Distributed Memory Bus Computers
In this paper we study the problems of sorting and selection on the Distributed Memory Bus Computer (DMBC) recently introduced by Sahni. In particular we present: 1) An efficient a...
Sanguthevar Rajasekaran, Sartaj Sahni
CLUSTER
2007
IEEE
15 years 11 months ago
Network performance model for TCP/IP based cluster computing
— A new communication model, called the PlogPT model, is proposed to predict communication performance in a commodity cluster where computing nodes communicate using TCP/IP. This...
Akihiro Nomura, Hiroya Matsuba, Yutaka Ishikawa
210
Voted
FOCS
1992
IEEE
15 years 9 months ago
Computing in Solvable Matrix Groups
We announce methods for e cient management of solvable matrix groups over nite elds. We show that solvability and nilpotence can be tested in polynomial-time. Such e ciency seems ...
Eugene M. Luks
SOFSEM
2009
Springer
15 years 9 months ago
Randomness and Determination, from Physics and Computing towards Biology
In this text we will discuss different forms of randomness in Natural Sciences and present some recent results relating them. In finite processes, randomness differs in various ...
Giuseppe Longo