Sciweavers

38 search results - page 4 / 8
» Extremal graphs for the identifying code problem
Sort
View
GECCO
2008
Springer
115views Optimization» more  GECCO 2008»
13 years 8 months ago
A genetic programming approach to business process mining
The aim of process mining is to identify and extract process patterns from data logs to reconstruct an overall process flowchart. As business processes become more and more comple...
Chris J. Turner, Ashutosh Tiwari, Jörn Mehnen
CIKM
2009
Springer
13 years 10 months ago
Semantic queries in databases: problems and challenges
Supporting semantic queries in relational databases is essential to many advanced applications. Recently, with the increasing use of ontology in various applications, the need for...
Lipyeow Lim, Haixun Wang, Min Wang
IJCAI
2003
13 years 8 months ago
Making the Breakout Algorithm Complete Using Systematic Search
Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unso...
Carlos Eisenberg, Boi Faltings
IEEEINTERACT
2002
IEEE
14 years 8 days ago
Code Cache Management Schemes for Dynamic Optimizers
A dynamic optimizer is a software-based system that performs code modifications at runtime, and several such systems have been proposed over the past several years. These systems ...
Kim M. Hazelwood, Michael D. Smith
LCTRTS
2005
Springer
14 years 25 days ago
A dictionary construction technique for code compression systems with echo instructions
Dictionary compression mechanisms identify redundant sequences of instructions that occur in a program. The sequences are extracted and copied to a dictionary. Each sequence is th...
Philip Brisk, Jamie Macbeth, Ani Nahapetian, Majid...