2693 search results - page 415 / 539 » On Computing Complex Navigation Functions |
178
click to vote
AGENTS
2000
Springer
15 years 10 months ago
2000
Springer
This paper extends earlier work in the use of ‘Agent-based Computational Economics’ (ACE) for modelling the development of co-operation between firms. Inter-firm relations hav...
189
click to vote
DATE
1999
IEEE
15 years 10 months ago
1999
IEEE
In this paper, new and efficient BIST methodology and BIST hardware insertion algorithms are presented for RTL data paths obtained from high level synthesis. The methodology is ba...
181
click to vote
COCO
1999
Springer
15 years 10 months ago
1999
Springer
Recent work by Bernasconi, Damm and Shparlinski showed that the set of square-free numbers is not in AC0 , and raised as an open question whether similar (or stronger) lower bound...
157
click to vote
COCOON
1999
Springer
15 years 10 months ago
1999
Springer
Cai and Selman [CS99] defined a modification of Levin’s notion of average polynomial time and proved, for every P-bi-immune language L and every polynomial-time computable dis...
167
click to vote
ISCAS
1999
IEEE
15 years 10 months ago
1999
IEEE
This paper considers the minimax filtering problem in which the supremum norm of weighted error sequence is minimized. It is shown that the minimax solution is also the optimal Se...