494 search results - page 39 / 99 » Heap Building Bounds |
76
Voted
ICRA
2002
IEEE
15 years 4 months ago
2002
IEEE
We discuss the theoretical limitations for reconfiguration of metamorphic robots made up of Telecubes, six degree of freedom cube shaped modules currently being developed at Xerox...
AGENTS
2000
Springer
15 years 3 months ago
2000
Springer
Design-to-Criteria builds custom schedules for agents that meet hard temporal constraints, hard resource constraints, and soft constraints stemming from soft task interactions or ...
103
click to vote
RTA
1997
Springer
15 years 3 months ago
1997
Springer
In the development of algorithms for finding the minimal solutions of systems of linear Diophantine equations, little use has been made (to our knowledge) of the results by Stanle...
NIPS
2004
15 years 13 days ago
2004
We propose a "soft greedy" learning algorithm for building small conjunctions of simple threshold functions, called rays, defined on single real-valued attributes. We al...
COLING
1996
15 years 11 days ago
1996
The paper describes a system which uses packed parser output directly to build semantic representations. More specifically, the system takes as input Packed Shared Forests in the ...