• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 11 - 20 of 120,483
Next 10 →

Numerical integration of the Cartesian equations of motion of a system with constraints: molecular dynamics of n-alkanes

by Jean-paul Ryckaert, Giovanni Ciccotti, Herman J. C. Berendsen - J. Comput. Phys , 1977
"... A numerical algorithm integrating the 3N Cartesian equations of motion of a system of N points subject to holonomic constraints is formulated. The relations of constraint remain perfectly fulfilled at each step of the trajectory despite the approximate character of numerical integration. The method ..."
Abstract - Cited by 704 (6 self) - Add to MetaCart
(MD), which has been widely used in the past for studying simple liquids and solids, has more recently been applied to molecular systems with internal degrees of freedom such as N, [l], H,O [2] and even C,H,, [3]. In applying the MD method three problems arise: (a) the choice of a suitable mechanical

UPPAAL in a Nutshell

by Kim G. Larsen, Paul Pettersson, Wang Yi , 1997
"... . This paper presents the overall structure, the design criteria, and the main features of the tool box Uppaal. It gives a detailed user guide which describes how to use the various tools of Uppaal version 2.02 to construct abstract models of a real-time system, to simulate its dynamical behavior, ..."
Abstract - Cited by 662 (51 self) - Add to MetaCart
. This paper presents the overall structure, the design criteria, and the main features of the tool box Uppaal. It gives a detailed user guide which describes how to use the various tools of Uppaal version 2.02 to construct abstract models of a real-time system, to simulate its dynamical behavior

Comparison of Broadcasting Techniques for Mobile Ad Hoc Networks

by Brad Williams, Tracy Camp - MOBIHOC'02 , 2002
"... Network wide broadcasting in Mobile Ad Hoc Networks provides important control and route establishment functionality for a number of unicast and multicast protocols. Considering its wide use as a building block for other network layer protocols, the MANET community needs to standardize a single meth ..."
Abstract - Cited by 519 (4 self) - Add to MetaCart
into categories and simulating a subset of each category, thus supplying a condensed but comprehensive side by side comparison. The simulations are designed to pinpoint, in each category, specific failures to network conditions that are relevant to MANETs, e.g., bandwidth congestion and dynamic topologies

Performance comparison of two on-demand routing protocols for ad hoc networks

by Samir R. Das, Charles E. Perkins , Elizabeth M. Royer , 2000
"... Ad hoc networks are characterized by multihop wireless connectivity, frequently changing network topology and the need for efficient dynamic routing protocols. We compare the performance of two prominent ondemand routing protocols for mobile ad hoc networks — Dynamic Source Routing (DSR) and Ad Ho ..."
Abstract - Cited by 554 (21 self) - Add to MetaCart
Hoc On-Demand Distance Vector Routing (AODV). A detailed simulation model with MAC and physical layer models is used to study interlayer interactions and their performance implications. We demonstrate that even though DSR and AODV share a similar on-demand behavior, the differences in the protocol

Regularization and variable selection via the Elastic Net.

by Hui Zou , Trevor Hastie - J. R. Stat. Soc. Ser. B , 2005
"... Abstract We propose the elastic net, a new regularization and variable selection method. Real world data and a simulation study show that the elastic net often outperforms the lasso, while enjoying a similar sparsity of representation. In addition, the elastic net encourages a grouping effect, wher ..."
Abstract - Cited by 973 (11 self) - Add to MetaCart
Abstract We propose the elastic net, a new regularization and variable selection method. Real world data and a simulation study show that the elastic net often outperforms the lasso, while enjoying a similar sparsity of representation. In addition, the elastic net encourages a grouping effect

Regression Shrinkage and Selection Via the Lasso

by Robert Tibshirani - JOURNAL OF THE ROYAL STATISTICAL SOCIETY, SERIES B , 1994
"... We propose a new method for estimation in linear models. The "lasso" minimizes the residual sum of squares subject to the sum of the absolute value of the coefficients being less than a constant. Because of the nature of this constraint it tends to produce some coefficients that are exactl ..."
Abstract - Cited by 4212 (49 self) - Add to MetaCart
that are exactly zero and hence gives interpretable models. Our simulation studies suggest that the lasso enjoys some of the favourable properties of both subset selection and ridge regression. It produces interpretable models like subset selection and exhibits the stability of ridge regression. There is also

Ant Colony System: A cooperative learning approach to the traveling salesman problem

by Marco Dorigo, Luca Maria Gambardella - IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION , 1997
"... This paper introduces the ant colony system (ACS), a distributed algorithm that is applied to the traveling salesman problem (TSP). In the ACS, a set of cooperating agents called ants cooperate to find good solutions to TSP’s. Ants cooperate using an indirect form of communication mediated by a pher ..."
Abstract - Cited by 1029 (53 self) - Add to MetaCart
pheromone they deposit on the edges of the TSP graph while building solutions. We study the ACS by running experiments to understand its operation. The results show that the ACS outperforms other nature-inspired algorithms such as simulated annealing and evolutionary computation, and we conclude comparing

The Vocabulary Problem in Human-System Communication

by G. W. Furnas, T. K. Landauer, L. M. Gomez, S. T. Dumais - COMMUNICATIONS OF THE ACM , 1987
"... In almost all computer applications, users must enter correct words for the desired objects or actions. For success without extensive training, or in first-tries for new targets, the system must recognize terms that will be chosen spontaneously. We studied spontaneous word choice for objects in five ..."
Abstract - Cited by 562 (8 self) - Add to MetaCart
In almost all computer applications, users must enter correct words for the desired objects or actions. For success without extensive training, or in first-tries for new targets, the system must recognize terms that will be chosen spontaneously. We studied spontaneous word choice for objects

Coordination of Groups of Mobile Autonomous Agents Using Nearest Neighbor Rules

by A. Jadbabaie, J. Lin, A. S. Morse , 2002
"... In a recent Physical Review Letters paper, Vicsek et. al. propose a simple but compelling discrete-time model of n autonomous agents fi.e., points or particlesg all moving in the plane with the same speed but with dierent headings. Each agent's heading is updated using a local rule based on ..."
Abstract - Cited by 1290 (62 self) - Add to MetaCart
on the average of its own heading plus the headings of its \neighbors." In their paper, Vicsek et. al. provide simulation results which demonstrate that the nearest neighbor rule they are studying can cause all agents to eventually move in the same direction despite the absence of centralized

MACAW: A Media Access Protocol for Wireless LAN's

by Vaduvur Bharghavan, et al.
"... In recent years, a wide variety of mobile computing devices has emerged, including portables, palmtops, and personal digital assistants. Providing adequate network connectivity for these devices will require a new generation of wireless LAN technology. In this paper we study media access protocols f ..."
Abstract - Cited by 839 (11 self) - Add to MetaCart
In recent years, a wide variety of mobile computing devices has emerged, including portables, palmtops, and personal digital assistants. Providing adequate network connectivity for these devices will require a new generation of wireless LAN technology. In this paper we study media access protocols
Next 10 →
Results 11 - 20 of 120,483
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University