Sciweavers

721 search results - page 138 / 145
» On Generators of Random Quasigroup Problems
Sort
View
JSAT
2008
122views more  JSAT 2008»
13 years 7 months ago
SAT Algorithms for Colouring Some Special Classes of Graphs: Some Theoretical and Experimental Results
The local search algorithm GSAT is based on the notion of Satisfiability. It has been used successfully for colouring graphs, solving instances of the 3SAT problem, planning block...
Sriyankar Acharyya
JGAA
2006
120views more  JGAA 2006»
13 years 7 months ago
Distributing Unit Size Workload Packages in Heterogeneous Networks
The task of balancing dynamically generated work load occurs in a wide range of parallel and distributed applications. Diffusion based schemes, which belong to the class of neares...
Robert Elsässer, Burkhard Monien, Stefan Scha...
MST
2006
104views more  MST 2006»
13 years 7 months ago
Sequencing from Compomers: The Puzzle
The board game FragmindTM poses the following problem: The player has to reconstruct an (unknown) string s over the alphabet . To this end, the game reports the following informati...
Sebastian Böcker
IMCSIT
2010
13 years 5 months ago
Efficient Portfolio Optimization with Conditional Value at Risk
The portfolio optimization problem is modeled as a mean-risk bicriteria optimization problem where the expected return is maximized and some (scalar) risk measure is minimized. In ...
Wlodzimierz Ogryczak, Tomasz Sliwinski
ICIP
2002
IEEE
14 years 9 months ago
A method for color naming and description of color composition in images
Color is one of the main visual cues and has been frequently used in image processing, analysis and retrieval. The extraction of highlevel color descriptors is an increasingly imp...
Aleksandra Mojsilovic