Sciweavers

6142 search results - page 471 / 1229
» The Complexity of Partition Functions
Sort
View
STOC
2004
ACM
102views Algorithms» more  STOC 2004»
16 years 7 months ago
A simple polynomial-time rescaling algorithm for solving linear programs
The perceptron algorithm, developed mainly in the machine learning literature, is a simple greedy method for finding a feasible solution to a linear program (alternatively, for le...
John Dunagan, Santosh Vempala
DATE
2009
IEEE
112views Hardware» more  DATE 2009»
16 years 1 months ago
Test exploration and validation using transaction level models
—The complexity of the test infrastructure and test strategies in systems-on-chip approaches the complexity of the functional design space. This paper presents test design space ...
Michael A. Kochte, Christian G. Zoellin, Michael E...
178
Voted
RTA
2009
Springer
16 years 1 months ago
Dependency Pairs and Polynomial Path Orders
Abstract. We show how polynomial path orders can be employed efficiently in conjunction with weak innermost dependency pairs to automatically certify the polynomial runtime comple...
Martin Avanzini, Georg Moser
ETFA
2008
IEEE
16 years 1 months ago
Challenges in the development of Mechatronic systems: The Mechatronic Component
— There is a need to replace existing mechanical and electromechanical systems with new ones, where functionality will be mainly implemented by software. The traditional approach...
Kleanthis Thramboulidis
188
Voted
ICRA
2008
IEEE
160views Robotics» more  ICRA 2008»
16 years 1 months ago
No robot left behind: Coordination to overcome local minima in swarm navigation
Abstract— In this paper, we address navigation and coordination methods that allow swarms of robots to converge and spread along complex 2D shapes in environments containing unkn...
Leandro Soriano Marcolino, Luiz Chaimowicz