Sciweavers

460 search results - page 30 / 92
» RTL-Datapath Verification using Integer Linear Programming
Sort
View
CPM
2010
Springer
140views Combinatorics» more  CPM 2010»
14 years 5 days ago
Bounds on the Minimum Mosaic of Population Sequences under Recombination
We study the minimum mosaic problem, an optimization problem originated in population genomics. We develop a new lower bound, called the C bound. The C bound is provably higher and...
Yufeng Wu
AUTOMATICA
2006
97views more  AUTOMATICA 2006»
13 years 7 months ago
Receding horizon control applied to optimal mine planning
In this paper we show that the problem of optimal mine planning can be cast in the framework of receding horizon control. Traditional formulations of this problem have cast it in ...
Graham C. Goodwin, María M. Seron, Richard ...
CIKM
2011
Springer
12 years 7 months ago
Joint inference for cross-document information extraction
Previous information extraction (IE) systems are typically organized as a pipeline architecture of separated stages which make independent local decisions. When the data grows bey...
Qi Li, Sam Anzaroot, Wen-Pin Lin, Xiang Li, Heng J...
AOSD
2009
ACM
13 years 9 months ago
Modular verification of dynamically adaptive systems
Cyber-physical systems increasingly rely on dynamically adaptive programs to respond to changes in their physical environment; examples include ecosystem monitoring and disaster r...
Ji Zhang, Heather Goldsby, Betty H. C. Cheng
CP
2004
Springer
14 years 23 days ago
A Hybrid Method for Planning and Scheduling
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...
John N. Hooker