Sciweavers

460 search results - page 64 / 92
» RTL-Datapath Verification using Integer Linear Programming
Sort
View
DSS
2006
95views more  DSS 2006»
13 years 8 months ago
On the computability of agent-based workflows
Workflow research is commonly concerned with optimization, modeling, and dependency. In this research, we however address a more fundamental issue. By modeling humans and machines...
Wai Yin Mok, Prashant Palvia, David Paper
CADE
2002
Springer
14 years 8 months ago
Lazy Theorem Proving for Bounded Model Checking over Infinite Domains
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
Harald Rueß, Leonardo Mendonça de Mou...
ESEM
2008
ACM
13 years 10 months ago
A constrained regression technique for cocomo calibration
Building cost estimation models is often considered a search problem in which the solver should return an optimal solution satisfying an objective function. This solution also nee...
Vu Nguyen, Bert Steece, Barry W. Boehm
ICC
2007
IEEE
171views Communications» more  ICC 2007»
14 years 2 months ago
Partially Overlapped Channel Assignment for Multi-Channel Wireless Mesh Networks
— The aggregate capacity of wireless mesh networks can be increased by the use of multiple frequency channels and multiple network interface cards in each router. Recent results ...
Amir Hamed Mohsenian Rad, Vincent W. S. Wong
IOR
2007
106views more  IOR 2007»
13 years 8 months ago
Planning and Scheduling by Logic-Based Benders Decomposition
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
John N. Hooker