4498 search results - page 249 / 900 » How to Invent Functions |
127
click to vote
LCPC
1991
Springer
15 years 8 months ago
1991
Springer
The dependence ow graph is a novel intermediate representation for optimizingand parallelizing compilersthat can be viewed as an executable representation of program dependences. ...
121
click to vote
EUROSSC
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. In the domain of ubiquitous computing, the ability to identify the occurrence of situations is a core function of being ’contextaware’. Given the uncertain nature of ...
144
click to vote
AAAI
2007
15 years 7 months ago
2007
We consider the problem of computing optimal schedules in multi-agent systems. In these problems, actions of one agent can influence the actions of other agents, while the object...
122
click to vote
WSC
2007
15 years 7 months ago
2007
A new approach for overcoming broken ergodicity in Markov Chain Monte Carlo (MCMC) simulations of complex systems is described. The problem of broken ergodicity is often present i...
155
click to vote
APN
2008
Springer
15 years 6 months ago
2008
Springer
The aim of this tool paper is twofold: First we show that VipTool [9, 2] can now synthesize Petri nets from partially ordered runs. To integrate this extension and further new func...