Sciweavers

26354 search results - page 198 / 5271
» How we refactor, and how we know it
Sort
View
JCP
2007
118views more  JCP 2007»
15 years 6 months ago
Tutoring an Entire Game with Dynamic Strategy Graphs: The Mixed-Initiative Sudoku Tutor
Abstract— In this paper, we develop a mixed-initiative intelligent tutor for the game of Sudoku called MITS. We begin by developing a characterization of the strategies used in S...
Allan Caine, Robin Cohen
EH
2000
IEEE
123views Hardware» more  EH 2000»
15 years 11 months ago
The Test Vector Problem and Limitations to Evolving Digital Circuits
How do we know the correctness of an evolved circuit? While Evolutionary Hardware is exhibiting its effectiveness, we argue that it is very difficult to design a large-scale digit...
Kosuke Imamura, James A. Foster, Axel W. Krings
NIPS
2003
15 years 8 months ago
Learning Near-Pareto-Optimal Conventions in Polynomial Time
We study how to learn to play a Pareto-optimal strict Nash equilibrium when there exist multiple equilibria and agents may have different preferences among the equilibria. We focu...
Xiao Feng Wang, Tuomas Sandholm
AHSWN
2006
84views more  AHSWN 2006»
15 years 6 months ago
A Path Density Protocol for MANETs
Knowing or being able to measure the "path density" at sources of communications is essential to provide fair capacity distribution between sessions in multi-hop ad hoc ...
Evgeny Osipov, Christian F. Tschudin
SIGDOC
2005
ACM
16 years 4 days ago
Usability over time
Testing of usability could perhaps be more accurately described as testing of learnability. We know more about the problems of novice users than we know of the problems of experie...
Valerie Mendoza, David G. Novick