Sciweavers

3244 search results - page 235 / 649
» On convex complexity measures
Sort
View
ICECCS
2006
IEEE
124views Hardware» more  ICECCS 2006»
16 years 19 days ago
Engineering Emergence
We explore various deïŹnitions and characteristics of emergence, how we might recognise and measure emergence, and how we might engineer emergent systems. We discuss the TUNA (â€...
Susan Stepney, Fiona Polack, Heather R. Turner
JSSPP
2005
Springer
16 years 2 days ago
Pitfalls in Parallel Job Scheduling Evaluation
There are many choices to make when evaluating the performance of a complex system. In the context of parallel job scheduling, one must decide what workload to use and what measur...
Eitan Frachtenberg, Dror G. Feitelson
ICALP
2003
Springer
15 years 11 months ago
Sophistication Revisited
Kolmogorov complexity measures the ammount of information in a string as the size of the shortest program that computes the string. The Kolmogorov structure function divides the s...
Luis Antunes 0002, Lance Fortnow
CADE
1999
Springer
15 years 11 months ago
A PSpace Algorithm for Graded Modal Logic
We present a PSpace algorithm that decides satisïŹability of the graded modal logic Gr(KR)—a natural extension of propositional modal logic KR by counting expressions—which pl...
Stephan Tobies
CEC
2005
IEEE
15 years 8 months ago
Equilibrium selection by co-evolution for bargaining problems under incomplete information about time preferences
Abstract- The main purpose of this work is to measure the effect of bargaining players’ information completeness on agreements in evolutionary environments. We apply Co-evolution...
Nanlin Jin