Sciweavers

1050 search results - page 153 / 210
» Towards programming for the non-technical
Sort
View
ANOR
2006
64views more  ANOR 2006»
13 years 10 months ago
A note on asymptotic formulae for one-dimensional network flow problems
This note develops asymptotic formulae for single-commodity network flow problems with random inputs. The transportation linear programming problem (TLP) where N points lie in a r...
Carlos F. Daganzo, Karen R. Smilowitz
ENTCS
2007
112views more  ENTCS 2007»
13 years 10 months ago
A Calculus of Global Interaction based on Session Types
This paper proposes a calculus for describing communication-centred programs and discusses its use through a formal description of several use cases from real business protocols. ...
Marco Carbone, Kohei Honda, Nobuko Yoshida
FTEDA
2007
156views more  FTEDA 2007»
13 years 10 months ago
FPGA Architecture: Survey and Challenges
Field-Programmable Gate Arrays (FPGAs) have become one of the key digital circuit implementation media over the last decade. A crucial part of their creation lies in their archite...
Ian Kuon, Russell Tessier, Jonathan Rose
SIGCSE
2008
ACM
120views Education» more  SIGCSE 2008»
13 years 10 months ago
Computing and higher education in Peru
Abstract: In Peru, the computing discipline as an academic field has been neglected during decades deriving in a lowquality higher education system and consequently shaping an acad...
Marco A. Alvarez, José Baiocchi, José...
LOGCOM
1998
178views more  LOGCOM 1998»
13 years 9 months ago
Applying the Mu-Calculus in Planning and Reasoning about Action
Planning algorithms have traditionally been geared toward achievement goals in single-agent environments. Such algorithms essentially produce plans to reach one of a specified se...
Munindar P. Singh