Sciweavers

408 search results - page 68 / 82
» A lookahead strategy for solving large planning problems
Sort
View
EC
2012
289views ECommerce» more  EC 2012»
13 years 5 months ago
Multimodal Optimization Using a Bi-Objective Evolutionary Algorithm
In a multimodal optimization task, the main purpose is to find multiple optimal solutions (global and local), so that the user can have a better knowledge about different optima...
Kalyanmoy Deb, Amit Saha
JSAT
2008
122views more  JSAT 2008»
14 years 9 months ago
SAT Algorithms for Colouring Some Special Classes of Graphs: Some Theoretical and Experimental Results
The local search algorithm GSAT is based on the notion of Satisfiability. It has been used successfully for colouring graphs, solving instances of the 3SAT problem, planning block...
Sriyankar Acharyya
KDD
2006
ACM
208views Data Mining» more  KDD 2006»
15 years 10 months ago
Frequent subgraph mining in outerplanar graphs
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...
Tamás Horváth, Jan Ramon, Stefan Wro...
SSDBM
2008
IEEE
146views Database» more  SSDBM 2008»
15 years 4 months ago
Kriging for Localized Spatial Interpolation in Sensor Networks
Abstract. The presence of coverage holes can adversely affect the accurate representation of natural phenomena being monitored by a Wireless Sensor Network (WSN). Current WSN resea...
Muhammad Umer, Lars Kulik, Egemen Tanin
IMSCCS
2007
IEEE
15 years 3 months ago
A Mobile Ad Hoc Network with Mobile Satellite Earth-stations
Ad hoc networks face the problem of improving networks’ capacity and scalability. The scalability problem can be properly solved through physical hierarchy networking. In this p...
Song Han, Guochang Gu, Jun Ni