Sciweavers

TSMC
2011
324views more  TSMC 2011»
12 years 11 months ago
Genetic Algorithms With Guided and Local Search Strategies for University Course Timetabling
—The university course timetabling problem (UCTP) is a combinatorial optimization problem, in which a set of events has to be scheduled into time slots and located into suitable ...
Shengxiang Yang, Sadaf Naseem Jat
TVCG
2008
118views more  TVCG 2008»
13 years 4 months ago
Visual Perception and Mixed-Initiative Interaction for Assisted Visualization Design
This paper describes the integration of perceptual guidelines from human vision with an AI-based mixed-initiative search strategy. The result is a visualization assistant called Vi...
Christopher G. Healey, Sarat Kocherlakota, Vivek R...
JAIR
2008
126views more  JAIR 2008»
13 years 4 months ago
Cooperative Search with Concurrent Interactions
In this paper we show how taking advantage of autonomous agents' capability to maintain parallel interactions with others, and incorporating it into the cooperative economic ...
Efrat Manisterski, David Sarne, Sarit Kraus
DAM
2008
135views more  DAM 2008»
13 years 4 months ago
Edge ranking and searching in partial orders
: We consider a problem of searching an element in a partially ordered set (poset). The goal is to find a search strategy which minimizes the number of comparisons. Ben-Asher, Farc...
Dariusz Dereniowski
VLDB
1991
ACM
134views Database» more  VLDB 1991»
13 years 8 months ago
Extending the Search Strategy in a Query Optimizer
In order to cope efficiently with simple or complex queries as well as different application requirements (e.g., ad-hoc versus repetitive queries), a query optimizer ought to supp...
Rosana S. G. Lanzelotte, Patrick Valduriez
KDD
1995
ACM
98views Data Mining» more  KDD 1995»
13 years 8 months ago
Optimization and Simplification of Hierarchical Clusterings
Clustering is often used to discover structure in data. Clustering systems differ in the objective function used to evaluate clustering quality and the control strategy used to se...
Douglas Fisher
SEAL
1998
Springer
13 years 8 months ago
Robust Evolution Strategies
This paper empirically investigates the use and behaviour of Evolution Strategies (ES) algorithms on problems such as function optimisation and the use of evolutionary artificial ...
Kazuhiro Ohkura, Yoshiyuki Matsumura, Kanji Ueda
KIVS
1999
Springer
13 years 8 months ago
Strategies for Minimizing the Average Cost of Paging on the Air Interface
: Location Management of mobile users in a cellular network covers tracking and paging (searching) functionality. In this paper a sequential search strategy is proposed which reduc...
Dogan Kesdogan, Andrei Trofimov, Dirk Trossen
IWQOS
2001
Springer
13 years 9 months ago
Extending BGMP for Shared-Tree Inter-Domain QoS Multicast
QoS support poses new challenges to multicast routing especially for inter-domain multicast where network QoS characteristics will not be readily available as in intra-domain multi...
Aiguo Fei, Mario Gerla
DSN
2009
IEEE
13 years 11 months ago
Fitness-guided path exploration in dynamic symbolic execution
Dynamic symbolic execution is a structural testing technique that systematically explores feasible paths of the program under test by running the program with different test input...
Tao Xie, Nikolai Tillmann, Jonathan de Halleux, Wo...