Sciweavers

1101 search results - page 149 / 221
» heuristics 2007
Sort
View
COR
2010
123views more  COR 2010»
13 years 10 months ago
Decomposition, reformulation, and diving in university course timetabling
In many real-life optimisation problems, there are multiple interacting components in a solution. For example, different components might specify assignments to different kinds of...
Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, ...
GECCO
2007
Springer
276views Optimization» more  GECCO 2007»
14 years 4 months ago
Meta-optimizing semantic evolutionary search
I present MOSES (meta-optimizing semantic evolutionary search), a new probabilistic modeling (estimation of distribution) approach to program evolution. Distributions are not esti...
Moshe Looks
KDD
2007
ACM
192views Data Mining» more  KDD 2007»
14 years 10 months ago
Allowing Privacy Protection Algorithms to Jump Out of Local Optimums: An Ordered Greed Framework
Abstract. As more and more person-specific data like health information becomes available, increasing attention is paid to confidentiality and privacy protection. One proposed mode...
Rhonda Chaytor
ICCAD
2007
IEEE
87views Hardware» more  ICCAD 2007»
14 years 7 months ago
Optimal polynomial-time interprocedural register allocation for high-level synthesis and ASIP design
—Register allocation, in high-level synthesis and ASIP design, is the process of determining the number of registers to include in the resulting circuit or processor. The goal is...
Philip Brisk, Ajay K. Verma, Paolo Ienne
MUE
2007
IEEE
128views Multimedia» more  MUE 2007»
14 years 4 months ago
Designing, Developing, and Evaluating Context-Aware Systems
Context and context-awareness have been central issues in ubiquitous computing research for the last decade. Advances with regard to context acquisition and activity recognition a...
Yoosoo Oh, Albrecht Schmidt, Woontack Woo