8512 search results - page 1394 / 1703 » Computing Theory With Relevance |
183
Voted
ATAL
2009
Springer
16 years 1 months ago
2009
Springer
The stable marriage problem is a well-known problem of matching men to women so that no man and woman who are not married to each other both prefer each other. Such a problem has ...
158
click to vote
COCO
2009
Springer
16 years 1 months ago
2009
Springer
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...
169
Voted
ESA
2009
Springer
16 years 1 months ago
2009
Springer
We consider the problem of representing, in a space-efficient way, a function f : S → Σ such that any function value can be computed in constant time on a RAM. Specifically, ou...
155
click to vote
FMCAD
2009
Springer
16 years 1 months ago
2009
Springer
— There is a long history of investigations and debates on whether a sequence of retiming and resynthesis is complete for all sequential transformations (on steady states). It ha...
156
click to vote
ICFEM
2009
Springer
16 years 1 months ago
2009
Springer
An extension to action systems is presented facilitating the modeling of continuous behavior in the discrete domain. The original action system formalism has been developed by Back...