952 search results - page 157 / 191 » Computational complexity of stochastic programming problems |
233
click to vote
EH
1999
IEEE
1999
IEEE
Evolvable Hardware or Learning Hardware? Induction of State Machines from Temporal Logic Constraints
15 years 6 months ago
Here we advocate an approach to learning hardware based on induction of finite state machines from temporal logic constraints. The method involves training on examples, constraint...
116
click to vote
SIGMOD
2010
ACM
15 years 2 months ago
2010
ACM
In massively collaborative projects such as scientific or community databases, users often need to agree or disagree on the content of individual data items. On the other hand, tr...
140
Voted
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
149
Voted
ATAL
2010
Springer
15 years 3 months ago
2010
Springer
Social laws have proved to be a powerful and theoretically elegant framework for coordination in multi-agent systems. Most existing models of social laws assume that a designer is...
125
click to vote
PPOPP
2010
ACM
15 years 11 months ago
2010
ACM
Many large-scale parallel programs follow a bulk synchronous parallel (BSP) structure with distinct computation and communication phases. Although the communication phase in such ...