Sciweavers

1568 search results - page 128 / 314
» The problem of examination questions in algorithmics
Sort
View
EMSOFT
2009
Springer
15 years 8 months ago
Modular static scheduling of synchronous data-flow networks: an efficient symbolic representation
This paper addresses the question of producing modular sequential imperative code from synchronous data-flow networks. Precisely, given a system with several input and output flow...
Marc Pouzet, Pascal Raymond
ECSQARU
2009
Springer
15 years 11 months ago
Merging Belief Bases Represented by Logic Programs
Abstract. This paper presents a method which allows for merging beliefs expressed thanks to logic programming with stable model semantics. This method is based on the syntactic mer...
Julien Hué, Odile Papini, Eric Würbel
144
Voted
CHI
2011
ACM
14 years 8 months ago
When the implication is not to design (technology)
As HCI is applied in increasingly diverse contexts, it is important to consider situations in which computational or information technologies may be less appropriate. This paper p...
Eric P. S. Baumer, M. Six Silberman
189
Voted
AI
2002
Springer
15 years 4 months ago
Multiagent learning using a variable learning rate
Learning to act in a multiagent environment is a difficult problem since the normal definition of an optimal policy no longer applies. The optimal policy at any moment depends on ...
Michael H. Bowling, Manuela M. Veloso
FC
2005
Springer
83views Cryptology» more  FC 2005»
15 years 10 months ago
Secure Distributed Human Computation
We suggest a general paradigm of using large-scale distributed computation to solve difficult problems, but where humans can act as agents and provide candidate solutions. We are e...
Craig Gentry, Zulfikar Ramzan, Stuart G. Stubblebi...