Sciweavers

2343 search results - page 140 / 469
» Visual-Concept Search Solved
Sort
View
PATAT
2004
Springer
151views Education» more  PATAT 2004»
15 years 10 months ago
Decomposition and Parallelization of Multi-resource Timetabling Problems
The timetabling problem consists in fixing a sequence of meetings between teachers and students in a prefixed period of time (typically a week), satisfying a set of constraints of ...
Petr Slechta
ECAI
2006
Springer
15 years 8 months ago
On Probing and Multi-Threading in Platypus
The PLATYPUS approach offers a generic platform for distributed answer set solving, accommodating a variety of different architectures for distributing the search for answer sets a...
Jean Gressmann, Tomi Janhunen, Robert E. Mercer, T...
GECCO
2006
Springer
146views Optimization» more  GECCO 2006»
15 years 8 months ago
The dispersion metric and the CMA evolution strategy
An algorithm independent metric is introduced that measures the dispersion of a uniform random sample drawn from the top ranked percentiles of the search space. A low dispersion f...
Monte Lunacek, Darrell Whitley
INFOCOM
2010
IEEE
15 years 3 months ago
High Performance Dictionary-Based String Matching for Deep Packet Inspection
—Dictionary-Based String Matching (DBSM) is used in network Deep Packet Inspection (DPI) applications virus scanning [1] and network intrusion detection [2]. We propose the Pipel...
Yi-Hua Edward Yang, Hoang Le, Viktor K. Prasanna
COCOA
2010
Springer
15 years 2 months ago
Feasibility-Based Bounds Tightening via Fixed Points
Abstract. The search tree size of the spatial Branch-and-Bound algorithm for Mixed-Integer Nonlinear Programming depends on many factors, one of which is the width of the variable ...
Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Libert...