689 search results - page 50 / 138 » A Modal-Logic Based Graph Abstraction |
CEC
2009
IEEE
14 years 13 days ago
2009
IEEE
Abstract— We present a grammar-based genetic programming framework for the solving the timetabling problem via the evolution of constructive heuristics. The grammar used for prod...
CSCLP
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Traditional resources in scheduling are simple machines where a capacity is the main restriction. However, in practice there frequently appear resources with more complex...
CG
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Depth-first proof-number (df-pn) search is a powerful member of the family of algorithms based on proof and disproof numbers. While df-pn has succeeded in practice, its t...
TIT
1998
13 years 7 months ago
1998
Abstract— Many of the fundamental coding problems can be represented as graph problems. These problems are often intrinsically difficult and unsolved even if the code length is ...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract—Recently, cellular phone networks have begun allowing third-party applications to run over certain open-API phone operating systems such as Windows Mobile, Iphone and Go...