2713 search results - page 197 / 543 » Parameterized Tree Systems |
117
click to vote
OTM
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Changes in the characterization of instances in digital content are one of the rationales to evolve ontologies that support a domain. These changes can have impacts on on...
181
Voted
IWPEC
2010
Springer
15 years 1 months ago
2010
Springer
We consider the computational complexity of a problem modeling bribery in the context of voting systems. In the scenario of Swap Bribery, each voter assigns a certain price for swa...
148
click to vote
ICMLA
2009
15 years 1 months ago
2009
We describe a system that successfully transfers value function knowledge across multiple subdomains of realtime strategy games in the context of multiagent reinforcement learning....
127
Voted
ICRA
2009
IEEE
15 years 10 months ago
2009
IEEE
— Rapidly-exploring Random Trees (RRTs) are widely used to solve large planning problems where the scope prohibits the feasibility of deterministic solvers, but the efficiency o...
122
Voted
VMCAI
2007
Springer
15 years 10 months ago
2007
Springer
We define the class of single-parent heap systems, which rely on a singly-linked heap in order to model destructive updates on tree structures. This encoding has the advantage of ...