Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
13,693
Differential Evolution - A simple and efficient adaptive scheme for global optimization over continuous spaces
, 1995
"... A new heuristic approach for minimizing possibly nonlinear and non differentiable continuous space functions is presented. By means of an extensive testbed, which includes the De Jong functions, it will be demonstrated that the new method converges faster and with more certainty than Adaptive Simula ..."
Abstract
-
Cited by 427 (5 self)
- Add to MetaCart
Computer Science Institute, 1947 Center Street, Berkeley, CA 94704-1198, Suite 600, Fax: 510-643-7684. E-mail: storn@icsi.berkeley.edu. On leave from Siemens AG, ZFE T SN 2, OttoHahn -Ring 6, D-81739 Muenchen, Germany. Fax: 01149-636-44577, Email: rainer.storn@zfe.siemens.de. 2) 836 Owl Circle, Vacaville
Priority Encoding Transmission
- IEEE Transactions on Information Theory
, 1994
"... We introduce a new method, called Priority Encoding Transmission, for sending messages over lossy packet-based networks. When a message is to be transmitted, the user specifies a priority value for each part of the message. Based on the priorities, the system encodes the message into packets for tra ..."
Abstract
-
Cited by 311 (11 self)
- Add to MetaCart
for which a sufficient fraction of the encoding packets are received. International Computer Science Institute, Berkeley, California. Research supported in part by National Science Foundation operating grant NCR-941610 y Computer Science Department, Swiss Federal Institute of Technology, Zurich, Switzerland
An introduction to Kolmogorov Complexity and its Applications: Preface to the First Edition
, 1997
"... This document has been prepared using the L a T E X system. We thank Donald Knuth for T E X, Leslie Lamport for L a T E X, and Jan van der Steen at CWI for online help. Some figures were prepared by John Tromp using the xpic program. The London Mathematical Society kindly gave permission to reproduc ..."
Abstract
-
Cited by 2138 (120 self)
- Add to MetaCart
to reproduce a long extract by A.M. Turing. The Indian Statistical Institute, through the editor of Sankhy¯a, kindly gave permission to quote A.N. Kolmogorov. We gratefully acknowledge the financial support by NSF Grant DCR8606366, ONR Grant N00014-85-k-0445, ARO Grant DAAL03-86-K0171, the Natural Sciences
Parameterized Complexity
, 1998
"... the rapidly developing systematic connections between FPT and useful heuristic algorithms | a new and exciting bridge between the theory of computing and computing in practice. The organizers of the seminar strongly believe that knowledge of parameterized complexity techniques and results belongs ..."
Abstract
-
Cited by 1213 (77 self)
- Add to MetaCart
into the toolkit of every algorithm designer. The purpose of the seminar was to bring together leading experts from all over the world, and from the diverse areas of computer science that have been attracted to this new framework. The seminar was intended as the rst larger international meeting with a specic focus
Myrinet: A Gigabit-per-Second Local Area Network
- IEEE Micro
, 1995
"... Abstract. Myrinet is a new type of local-area network (LAN) based on the technology used for packet communication and switching within "massivelyparallel processors " (MPPs). Think of Myrinet as an MPP message-passing network that can span campus dimensions, rather than as a wide-a ..."
Abstract
-
Cited by 1011 (0 self)
- Add to MetaCart
such as Ethernet and FDDI, it is helpful to start with Myrinet's genealogy. Myrinet is rooted in the results of two ARPA-sponsored research projects, the Caltech Mosaic, an experimental, fine-grain multicomputer [1], and the USC Information Sciences Institute (USC/ISI) ATOMIC LAN [2, 3], which was built using
Self-Testing/Correcting with Applications to Numerical Problems
, 1990
"... Suppose someone gives us an extremely fast program P that we can call as a black box to compute a function f . Should we trust that P works correctly? A self-testing/correcting pair allows us to: (1) estimate the probability that P (x) 6= f(x) when x is randomly chosen; (2) on any input x, compute ..."
Abstract
-
Cited by 361 (27 self)
- Add to MetaCart
f(x) correctly as long as P is not too faulty on average. Furthermore, both (1) and (2) take time only slightly more than Computer Science Division, U.C. Berkeley, Berkeley, California 94720, Supported by NSF Grant No. CCR 88-13632. y International Computer Science Institute, Berkeley
Elephants don't play chess
- Robotics and Autonomous Systems
, 1990
"... Engineering and Computer Science at M.I.T. and a member of the Artificial Intelligence Laboratory where he leads the mobile robot group. He has authored two books, numerous scientific papers, and is the editor of the International Journal of Computer Vision. There is an alternative route to Artifici ..."
Abstract
-
Cited by 403 (4 self)
- Add to MetaCart
Engineering and Computer Science at M.I.T. and a member of the Artificial Intelligence Laboratory where he leads the mobile robot group. He has authored two books, numerous scientific papers, and is the editor of the International Journal of Computer Vision. There is an alternative route
Client Requirements For Real-Time Communication Services
- IEEE Communications Magazine
, 1990
"... A real-time communication service provides its clients with the ability to specify their performance requirements and to obtain guarantees about the satisfaction of those requirements. In this paper, we propose a set of performance specifications that seem appropriate for such services; they include ..."
Abstract
-
Cited by 246 (13 self)
- Add to MetaCart
, we present some examples of requirements specification, and discuss some of the possible objections to our approach. ############### This research has been supported in part by AT&T Bell Laboratories, the University of California under a MICRO grant, and the International Computer Science
Providing Deterministic Guarantees for Bursty Traffic (Extended Abstract)
, 1993
"... Hui Zhang and Domenico Ferrari hzhang,ferrari@tenet.ICSI.Berkeley.EDU The Tenet Group Computer Science Division University of California at Berkeley and International Computer Science Institute 1 ..."
Abstract
- Add to MetaCart
Hui Zhang and Domenico Ferrari hzhang,ferrari@tenet.ICSI.Berkeley.EDU The Tenet Group Computer Science Division University of California at Berkeley and International Computer Science Institute 1
Results 1 - 10
of
13,693
