7978 search results - page 5 / 1596 » Representation before computation |
WECWIS
2003
IEEE
13 years 11 months ago
2003
IEEE
Converting a conventional contract into an electronic equivalent that can be executed and enforced by computers is a challenging task. The difficulties are caused by the ambiguiti...
CEC
2008
IEEE
13 years 8 months ago
2008
IEEE
We present a simple framework for dealing with search spaces consisting of permutations. To demonstrate its usefulness, we build upon it a simple (1 + 1)-evolutionary algorithm fo...
STACS
2007
Springer
14 years 7 days ago
2007
Springer
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
TC
2011
13 years 1 months ago
2011
—During any composite computation, there is a constant need for rounding intermediate results before they can participate in further processing. Recently, a class of number repre...
MM
1996
ACM
13 years 10 months ago
1996
ACM
Narrative structure models are useful tools for understanding how and why narratives of any medium affect an audience's level of participation in their role of story reconstr...