Sciweavers

4451 search results - page 363 / 891
» On Random Ordering Constraints
Sort
View
166
Voted
CP
2004
Springer
16 years 5 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
COMCOM
1998
102views more  COMCOM 1998»
15 years 6 months ago
Preferred link based delay-constrained least-cost routing in wide area networks
Multimedia applications involving digital audio and/or digital video transmissions require strict QoS constraints (end-to-end delay bound, bandwidth availability, packet loss rate...
R. Sriram, Govindarasu Manimaran, C. Siva Ram Murt...
CEC
2008
IEEE
16 years 1 months ago
A multi-agent based evolutionary algorithm in non-stationary environments
— In this paper, a multi-agent based evolutionary algorithm (MAEA) is introduced to solve dynamic optimization problems. The agents simulate living organism features and co-evolv...
Yang Yan, Hongfeng Wang, Dingwei Wang, Shengxiang ...
GBRPR
2007
Springer
16 years 28 days ago
Grouping Using Factor Graphs: An Approach for Finding Text with a Camera Phone
Abstract. We introduce a new framework for feature grouping based on factor graphs, which are graphical models that encode interactions among arbitrary numbers of random variables....
Huiying Shen, James Coughlan
155
Voted
WISA
2007
Springer
16 years 27 days ago
Breaking 104 Bit WEP in Less Than 60 Seconds
We demonstrate an active attack on the WEP protocol that is able to recover a 104-bit WEP key using less than 40,000 frames with a success probability of 50%. In order to succeed i...
Erik Tews, Ralf-Philipp Weinmann, Andrei Pyshkin