Sciweavers

5493 search results - page 268 / 1099
» Effectively Polynomial Simulations
Sort
View
INFOCOM
2009
IEEE
16 years 1 months ago
Greedy Routing with Bounded Stretch
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...
Roland Flury, Sriram V. Pemmaraju, Roger Wattenhof...
ASPDAC
2009
ACM
164views Hardware» more  ASPDAC 2009»
16 years 1 months ago
Accounting for non-linear dependence using function driven component analysis
Majority of practical multivariate statistical analyses and optimizations model interdependence among random variables in terms of the linear correlation among them. Though linear...
Lerong Cheng, Puneet Gupta, Lei He
SIGECOM
2009
ACM
114views ECommerce» more  SIGECOM 2009»
16 years 1 months ago
Policy teaching through reward function learning
Policy teaching considers a Markov Decision Process setting in which an interested party aims to influence an agent’s decisions by providing limited incentives. In this paper, ...
Haoqi Zhang, David C. Parkes, Yiling Chen
CDC
2008
IEEE
144views Control Systems» more  CDC 2008»
16 years 1 months ago
Control software model checking using bisimulation functions for nonlinear systems
— This paper extends a method for integrating source-code model checking with dynamic system analysis to verify properties of controllers for nonlinear dynamic systems. Source-co...
James Kapinski, Alexandre Donzé, Flavio Ler...
GLOBECOM
2007
IEEE
16 years 28 days ago
Reduced Complexity Sphere Decoding for Square QAM via a New Lattice Representation
— Sphere decoding (SD) is a low complexity maximum likelihood (ML) detection algorithm, which has been adapted for different linear channels in digital communications. The comple...
Luay Azzam, Ender Ayanoglu