2877 search results - page 542 / 576 » The Complexity of Planarity Testing |
WSC
2000
15 years 21 days ago
2000
Discrete event simulations often require a future event list structure to manage events according to their timestamp. The choice of an efficient data structure is vital to the per...
WSC
1997
15 years 21 days ago
1997
We describe our experiences designing and implementing a virtual PNNI network testbed. The network elements and signaling protocols modeled are consistent with the ATM Forum PNNI ...
105
click to vote
IJCAI
1989
15 years 16 days ago
1989
gn problem can be abstractly characterized as a constrained function-to-structure mapping. The de sign task takes as input the specifications of the desired functions of a device...
101
click to vote
ATAL
2010
Springer
15 years 14 days ago
2010
Springer
A central problem in artificial intelligence is to choose actions to maximize reward in a partially observable, uncertain environment. To do so, we must learn an accurate model of ...
120
click to vote
ATAL
2010
Springer
15 years 14 days ago
2010
Springer
As learning agents move from research labs to the real world, it is increasingly important that human users, including those without programming skills, be able to teach agents de...