612 search results - page 30 / 123 » Hardness assumptions in the foundations of theoretical compu... |
GG
2004
Springer
14 years 1 months ago
2004
Springer
Refactorings are transformations that change the structure of a program, while preserving the behavior. The topic has attracted a lot of attention recently, since it is a promising...
GI
2005
Springer
14 years 1 months ago
2005
Springer
: In this paper we present a routing scheme for on-demand construction of multiple non-interfering paths in wireless sensor networks. One usage of this multipath scheme is to provi...
ICTCS
2001
Springer
14 years 5 days ago
2001
Springer
In this paper we study the job shop scheduling problem under the assumption that the jobs have controllable processing times. The fact that the jobs have controllable processing t...
SIGCSE
2009
ACM
14 years 2 months ago
2009
ACM
Jeannette Wing’s call for teaching Computational Thinking (CT) as a formative skill on par with reading, writing, and arithmetic places computer science in the category of basic...
SIGCSE
1998
ACM
13 years 12 months ago
1998
ACM
First-year computer science students need to see clearly that computer science as a discipline has an important intellectual role to play and that it offers deep philosophical que...