1204 search results - page 155 / 241 » Termination of Polynomial Programs |
76
Voted
NECO
2008
15 years 18 days ago
2008
A new gradient technique is introduced for linear ICA based on the Edgeworth expansion of mutual information, for which the algorithm operates sequentially using fixed-point itera...
97
Voted
ENTCS
2002
15 years 14 days ago
2002
In previous work [14] I introduced a generalised notion of coalgebra that is capable of modelling binary methods as they occur in object-oriented programming. An important problem...
106
Voted
JCO
2002
15 years 10 days ago
2002
The single machine scheduling problem with sum of completion times criterion (SS) can be solved easily by the Shortest Processing Time (SPT) rule. In the case of significant uncert...
115
click to vote
ISPD
2009
ACM
15 years 7 months ago
2009
ACM
As VLSI technology moves to the 65nm node and beyond, interconnect delay greatly limits the circuit performance. As a critical component in interconnect synthesis, layer assignmen...
107
Voted
EOR
2008
15 years 22 days ago
2008
We study a scheduling problem, motivated by air-traffic control, in which a set of aircrafts are about to land on a single runway. When coming close to the landing area of the air...