644 search results - page 26 / 129 » Decomposition Complexity |
101
Voted
MP
2006
15 years 15 days ago
2006
Abstract. Traditional stochastic programming is risk neutral in the sense that it is concerned with the optimization of an expectation criterion. A common approach to addressing ri...
80
Voted
ICANN
2009
Springer
15 years 7 months ago
2009
Springer
The processes giving rise to an event related potential engage several evoked and induced oscillatory components, which reflect phase or non-phase locked activity throughout the mu...
105
click to vote
ISAAC
2007
Springer
15 years 6 months ago
2007
Springer
The problem of maintaining a representation of a dynamic graph as long as a certain property is satisfied has recently been considered for a number of properties. This paper prese...
104
Voted
CP
2005
Springer
15 years 6 months ago
2005
Springer
This paper describes an efficient, complete approach for solving a complex allocation and scheduling problem for Multi-Processor System-on-Chip (MPSoC). Given a throughput constra...
89
Voted
CP
2005
Springer
15 years 6 months ago
2005
Springer
Besides search, complete inference methods can also be used to solve soft constraint problems. Their main drawback is the high spatial complexity. To improve its practical usage, w...