Sciweavers

2693 search results - page 77 / 539
» On Computing Complex Navigation Functions
Sort
View
JUCS
2008
151views more  JUCS 2008»
13 years 10 months ago
The Bit-Complexity of Finding Nearly Optimal Quadrature Rules for Weighted Integration
: Given a probability measure and a positive integer n. How to choose n knots and n weights such that the corresponding quadrature rule has the minimum worst-case error when appli...
Volker Bosserhoff
TCS
2011
13 years 5 months ago
Realizability models and implicit complexity
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
Ugo Dal Lago, Martin Hofmann
IH
2009
Springer
14 years 4 months ago
Hardware-Based Public-Key Cryptography with Public Physically Unclonable Functions
Abstract. A physically unclonable function (PUF) is a multiple-input, multipleoutput, large entropy physical system that is unreproducible due to its structural complexity. A publi...
Nathan Beckmann, Miodrag Potkonjak
ICRA
2006
IEEE
143views Robotics» more  ICRA 2006»
14 years 4 months ago
Evaluation of a Large Scale Pervasive Embedded Network for Robot Path Planning
— We investigate a technique that uses an embedded network deployed pervasively throughout an environment to aid robots in navigation. First, we show that the path computed by th...
Keith J. O'Hara, Victor Bigio, Shaun Whitt, Daniel...
ECAL
2005
Springer
14 years 3 months ago
Artificial Homeostatic System: A Novel Approach
Abstract. Many researchers are developing frameworks inspired by natural, especially biological, systems to solve complex real-world problems. This work extends previous work in th...
Patrícia Amâncio Vargas, Renan C. Moi...