Sciweavers

602 search results - page 73 / 121
» Unsupervised Problem Decomposition Using Genetic Programming
Sort
View
RECOMB
2006
Springer
14 years 11 months ago
Inferring Gene Orders from Gene Maps Using the Breakpoint Distance
Abstract. Preliminary to most comparative genomics studies is the annotation of chromosomes as ordered sequences of genes. Unfortunately, different genetic mapping techniques usual...
Guillaume Blin, Eric Blais, Pierre Guillon, Mathie...
CONSTRAINTS
2011
13 years 2 months ago
CP and IP approaches to cancer radiotherapy delivery optimization
Abstract. We consider the problem of decomposing an integer matrix into a positively weighted sum of binary matrices that have the consecutive-ones property. This problem is well-k...
Davaatseren Baatar, Natashia Boland, Sebastian Bra...
AI
1999
Springer
13 years 10 months ago
Learning Action Strategies for Planning Domains
There are many different approaches to solving planning problems, one of which is the use of domain specific control knowledge to help guide a domain independent search algorithm. ...
Roni Khardon
SIGCSE
2010
ACM
189views Education» more  SIGCSE 2010»
14 years 5 months ago
Principles of asking effective questions during student problem solving
Using effective teaching practices is a high priority for educators. One important pedagogical skill for computer science instructors is asking effective questions. This paper pre...
Kristy Elizabeth Boyer, William Lahti, Robert Phil...
TSP
2008
123views more  TSP 2008»
13 years 11 months ago
A Rough Programming Approach to Power-Balanced Instruction Scheduling for VLIW Digital Signal Processors
The focus of this paper is on VLIW instruction scheduling that minimizes the variation of power consumed by the processor during the execution of a target program. We use rough set...
Shu Xiao, Edmund Ming-Kit Lai