62 search results - page 3 / 13 » Some Quasi-Varieties of Iteration Theories |
LATIN
2010
Springer
15 years 2 months ago
2010
Springer
In this paper we design an iterative rounding approach for the classic prize-collecting Steiner forest problem and more generally the prize-collecting survivable Steiner network de...
IANDC
2007
14 years 9 months ago
2007
The present study aims at insights into the nature of incremental learning in the context of Gold’s model of identification in the limit. With a focus on natural requirements s...
120
click to vote
FOSSACS
2001
Springer
15 years 2 months ago
2001
Springer
Hierarchical Message Sequence Charts are a well-established formalism to specify telecommunication protocols. In this model, numerous undecidability results were obtained recently ...
129
Voted
CP
2004
Springer
15 years 2 months ago
2004
Springer
The success of stochastic algorithms is often due to their ability to effectively amplify the performance of search heuristics. This is certainly the case with stochastic sampling ...
ICIP
2009
IEEE
15 years 10 months ago
2009
IEEE
This work focuses on several optimization problems involved in recovery of sparse solutions of linear inverse problems. Such problems appear in many fields including image and sig...