• 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 1 - 10 of 1,236
Next 10 →

FastSLAM: A Factored Solution to the Simultaneous Localization and Mapping Problem

by Michael Montemerlo, Sebastian Thrun, Daphne Koller, Ben Wegbreit - In Proceedings of the AAAI National Conference on Artificial Intelligence , 2002
"... The ability to simultaneously localize a robot and accurately map its surroundings is considered by many to be a key prerequisite of truly autonomous robots. However, few approaches to this problem scale up to handle the very large number of landmarks present in real environments. Kalman filter-base ..."
Abstract - Cited by 599 (10 self) - Add to MetaCart
The ability to simultaneously localize a robot and accurately map its surroundings is considered by many to be a key prerequisite of truly autonomous robots. However, few approaches to this problem scale up to handle the very large number of landmarks present in real environments. Kalman filter

Distributed Object Location in a Dynamic Network

by Kirsten Hildrum, John D. Kubiatowicz, Satish Rao, Ben Y. Zhao , 2004
"... Modern networking applications replicate data and services widely, leading to a need for location-independent routing---the ability to route queries to objects using names independent of the objects' physical locations. Two important properties of such a routing infrastructure are routing local ..."
Abstract - Cited by 193 (17 self) - Add to MetaCart
Modern networking applications replicate data and services widely, leading to a need for location-independent routing---the ability to route queries to objects using names independent of the objects' physical locations. Two important properties of such a routing infrastructure are routing

An Incremental Approach to the Proportional GA

by Han Yu, Annie S. Wu
"... The Proportional Genetic Algorithm (PGA) supports truly location independent solution encoding. In this paper, we propose a novel approach, called incremental building blocks, to improve the search performance of PGA. The main idea of this approach is to evolve low level building blocks individually ..."
Abstract - Add to MetaCart
The Proportional Genetic Algorithm (PGA) supports truly location independent solution encoding. In this paper, we propose a novel approach, called incremental building blocks, to improve the search performance of PGA. The main idea of this approach is to evolve low level building blocks

A Truly Implementation Independent GUI Development Tool

by Martin C. Carlisle - SIGAda Letters, Vol XIX , 1999
"... Over the last few years, graphical user interface programming has become increasingly prevalent. Many libraries and languages have been developed to simplify this task. Additionally, design tools have been created that allow the programmer to “draw ” their desired interface and then have code automa ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
automatically generated. Unfortunately, use of these tools locks the programmer into a particular implementation. Even if the tool targets a multi-platform library (e.g. Tcl/Tk or JVM), the flexibility of the result is constrained. We present a truly implementation and platform independent solution. RAPID

Resilient Mechanisms for Truly Combinatorial Auctions

by Silvio Micali, Paul Valiant - SUBMITTED TO SYMPOSIUM ON THEORY , 2008
"... Dominant-strategy truthfulness is traditionally considered the best possible solution concept in mechanism design, as it enables one to predict with confidence which strategies independent players will actually choose. Yet, as with any other form of equilibrium, it too can be extremely vulnerable to ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
Dominant-strategy truthfulness is traditionally considered the best possible solution concept in mechanism design, as it enables one to predict with confidence which strategies independent players will actually choose. Yet, as with any other form of equilibrium, it too can be extremely vulnerable

Feature location using probabilistic ranking of methods based on execution scenarios and information retrieval

by Denys Poshyvanyk, Yann-gaël Guéhéneuc, Andrian Marcus - IEEE Trans. Software Eng , 2007
"... Abstract—This paper recasts the problem of feature location in source code as a decision-making problem in the presence of uncertainty. The solution to the problem is formulated as a combination of the opinions of different experts. The experts in this work are two existing techniques for feature lo ..."
Abstract - Cited by 115 (48 self) - Add to MetaCart
Abstract—This paper recasts the problem of feature location in source code as a decision-making problem in the presence of uncertainty. The solution to the problem is formulated as a combination of the opinions of different experts. The experts in this work are two existing techniques for feature

Building a Truly Distributed Constraint Solver with JADE

by Ibrahim Adeyanju
"... Real life problems such as scheduling meeting between people at different locations can be modelled as distributed Constraint Satisfaction Problems (CSPs). Suitable and satisfactory solutions can then be found using constraint satisfaction algorithms which can be exhaustive (backtracking) or otherwi ..."
Abstract - Add to MetaCart
Real life problems such as scheduling meeting between people at different locations can be modelled as distributed Constraint Satisfaction Problems (CSPs). Suitable and satisfactory solutions can then be found using constraint satisfaction algorithms which can be exhaustive (backtracking

Whom You Know Matters: Venture Capital Networks and Investment Performance,

by Yael Hochberg , Alexander Ljungqvist , Yang Lu , Steve Drucker , Jan Eberly , Eric Green , Yaniv Grinstein , Josh Lerner , Laura Lindsey , Max Maksimovic , Roni Michaely , Maureen O'hara , Ludo Phalippou Mitch Petersen , Jesper Sorensen , Per Strömberg Morten Sorensen , Yael Hochberg , Johnson - Journal of Finance , 2007
"... Abstract Many financial markets are characterized by strong relationships and networks, rather than arm's-length, spot-market transactions. We examine the performance consequences of this organizational choice in the context of relationships established when VCs syndicate portfolio company inv ..."
Abstract - Cited by 138 (8 self) - Add to MetaCart
signals and thereby may select better investments in situations of often extreme uncertainty about the viability and return potential of investment proposals (Wilson (1968), Third, individual VCs tend to have investment expertise that is both sector-specific and location-specific. Syndication helps

Using Prospero to Support Integrated Location-Independent Computing

by B. Cli, Neuman Steven, Seger Augart, Shantaprasad Upasani
"... As computers become pervasive, users will access processing, storage, and communication resources from locations that have not been practical in the past. Such users will demand support for location-independent computing. While the basic system components used might change as the user moves from pla ..."
Abstract - Add to MetaCart
present solutions to these problems based on the Prospero Directory Service. The solutions demonstrate several unique features of Prospero that make it particularly suited for support of location-independent computing. 1

A New Truly Meshless Method for Heat Conduction in Solid Structures

by M M Aghdam , Nasrin Sheikhy , Eisa Ahmadi , ; M M Aghdam , Nasrin Sheikhy
"... Abstract-In this study a new meshless method is presented for the analysis of heat transfer in heterogeneous solid structures. The presented meshless method is based on the integral form of energy equation for the sub-particles in the domain of the material. A micromechanical model based on the pre ..."
Abstract - Add to MetaCart
is briefly described in this section. 2-2 Moving leas Square Approximation The first step in the solution procedure is to approximate the field variable u(x) over a number of randomly located nodes within the domain. One of the well-known methods for this purpose is the moving least squares (MLS) technique
Next 10 →
Results 1 - 10 of 1,236
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