Sciweavers

4222 search results - page 691 / 845
» Challenges in Service-Oriented Networking
Sort
View
CCO
2001
Springer
161views Combinatorics» more  CCO 2001»
15 years 4 months ago
Branch, Cut, and Price: Sequential and Parallel
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
Laszlo Ladányi, Ted K. Ralphs, Leslie E. Tr...
92
Voted
SIGUCCS
2000
ACM
15 years 4 months ago
Creating a Help Center from Scratch: A Recipe for Success
Creating a university Help Center from scratch can be a challenging yet very rewarding experience for an IT professional. Buying computers, building networks, and installing softw...
Patrick McKoen
82
Voted
GECCO
2006
Springer
195views Optimization» more  GECCO 2006»
15 years 3 months ago
Studying XCS/BOA learning in Boolean functions: structure encoding and random Boolean functions
Recently, studies with the XCS classifier system on Boolean functions have shown that in certain types of functions simple crossover operators can lead to disruption and, conseque...
Martin V. Butz, Martin Pelikan
CIKM
2008
Springer
15 years 1 months ago
SNIF TOOL: sniffing for patterns in continuous streams
Continuous time-series sequence matching, specifically, matching a numeric live stream against a set of predefined pattern sequences, is critical for domains ranging from fire spr...
Abhishek Mukherji, Elke A. Rundensteiner, David C....
ESWS
2008
Springer
15 years 1 months ago
Querying Distributed RDF Data Sources with SPARQL
Integrated access to multiple distributed and autonomous RDF data sources is a key challenge for many semantic web applications. As a reaction to this challenge, SPARQL, the W3C Re...
Bastian Quilitz, Ulf Leser