Sciweavers

34 search results - page 5 / 7
» New Bounds for Motif Finding in Strong Instances
Sort
View
GECCO
2006
Springer
212views Optimization» more  GECCO 2006»
13 years 11 months ago
Non-wrapping order crossover: an order preserving crossover operator that respects absolute position
In this paper, we introduce a new crossover operator for the permutation representation of a GA. This new operator-Non-Wrapping Order Crossover (NWOX)--is a variation of the well-...
Vincent A. Cicirello
WADS
2009
Springer
378views Algorithms» more  WADS 2009»
14 years 1 months ago
Two for One: Tight Approximation of 2D Bin Packing
In this paper, we study the two-dimensional geometrical bin packing problem (2DBP): given a list of rectangles, provide a packing of all these into the smallest possible number of ...
Klaus Jansen, Lars Prädel, Ulrich M. Schwarz
AAAI
2006
13 years 8 months ago
Overlapping Coalition Formation for Efficient Data Fusion in Multi-Sensor Networks
This paper develops new algorithms for coalition formation within multi-sensor networks tasked with performing widearea surveillance. Specifically, we cast this application as an ...
Viet Dung Dang, Rajdeep K. Dash, Alex Rogers, Nich...
COLING
1992
13 years 8 months ago
Zero Pronouns as Experiencer in Japanese Discourse
The process of finding the antecedent of zero pronoun, that is indispensable to Japanese language understanding, is the topic of this paper. Here we mainly concern with discourses...
Hiroshi Nakagawa
IJMC
2006
84views more  IJMC 2006»
13 years 7 months ago
Using a genetic algorithm approach to solve the dynamic channel-assignment problem
: The Channel Assignment Problem is an NP-complete problem to assign a minimum number of channels under certain constraints to requested calls in a cellular radio system. Examples ...
Xiannong Fu, Anu G. Bourgeois, Pingzhi Fan, Yi Pan