Sciweavers

2841 search results - page 42 / 569
» A Call to Order
Sort
View
JAMDS
2002
60views more  JAMDS 2002»
14 years 9 months ago
A simple proof of Suzumura's extension theorem for finite domains with applications
Abstract. In this paper we provide a simple proof of the extension theorem for partial orderings due to Suzumura [1983] when the domain of the partial order is finite. The extensio...
Somdeb Lahiri
GECCO
2007
Springer
157views Optimization» more  GECCO 2007»
15 years 4 months ago
Thoughts on solution concepts
This paper explores connections between Ficici’s notion of solution concept and order theory. Ficici postulates that algorithms should ascend an order called weak preference; th...
Anthony Bucci, Jordan B. Pollack
GPC
2007
Springer
14 years 11 months ago
Towards a Peer-To-Peer Platform for High Performance Computing
This paper describes a Global Computing (GC) environment, called XtremWeb-CH (XWCH). XWCH is an improved version of a GC tool called XtremWeb (XW). XWCH tries to enrich XW in orde...
Nabil Abdennadher, Régis Boesch
DAM
2008
116views more  DAM 2008»
14 years 10 months ago
Expected number of breakpoints after t random reversals in genomes with duplicate genes
In comparative genomics, one wishes to deduce the evolutionary distance between dierent species by studying their genomes. Using gene order information, we seek the number of time...
Niklas Eriksen
GPCE
2008
Springer
14 years 11 months ago
On the modularity of feature interactions
Feature modules are the building blocks of programs in software product lines (SPLs). A foundational assumption of feature-based program synthesis is that features are composed in...
Chang Hwan Peter Kim, Christian Kästner, Don ...