8413 search results - page 114 / 1683 » Ordering Problem Subgoals |
104
click to vote
TLCA
2005
Springer
15 years 6 months ago
2005
Springer
In a series of articles, we developed a method to translate general recursive functions written in a functional programming style into constructive type theory. Three problems rema...
117
click to vote
CP
2004
Springer
15 years 6 months ago
2004
Springer
This paper considers the problem of transforming a resource feasible, fixed-times schedule into a partial order schedule (POS) to enhance its robustness and stability properties. ...
TCOM
2008
15 years 22 days ago
2008
Abstract-- Traditionally, conflict resolution in an inputbuffered switch is solved by finding a matching between inputs and outputs per time slot. To do this, a switch not only nee...
124
Voted
COMBINATORICS
2002
15 years 20 days ago
2002
: We generalize the notion of pattern avoidance to arbitrary functions on ordered sets, and consider specifically three scenarios for permutations: linear, cyclic and hybrid, the f...
109
Voted
ICA
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. The recovery of the mixture of an N-dimensional signal generated by N independent processes is a well studied problem (see e.g. [1,10]) and robust algorithms that solve t...