3466 search results - page 654 / 694 » Fast computation of special resultants |
111
Voted
TASE
2008
IEEE
15 years 17 days ago
2008
IEEE
In this paper, we focus on mechanism design for single leader Stackelberg problems, which are a special case of hierarchical decision making problems in which a distinguished agent...
JCC
2007
15 years 17 days ago
2007
: We investigate the parallel scaling of the GROMACS molecular dynamics code on Ethernet Beowulf clusters and what prerequisites are necessary for decent scaling even on such clust...
96
Voted
TOPLAS
2008
15 years 16 days ago
2008
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
126
Voted
INFORMS
1998
15 years 10 days ago
1998
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
133
Voted
TCS
2010
14 years 11 months ago
2010
There has been much interest in testing from finite state machines (FSMs) as a result of their suitability for modelling or specifying state-based systems. Where there are multip...