Sciweavers

1047 search results - page 74 / 210
» Searching Without a Heuristic: Efficient Use of Abstraction
Sort
View
AAAI
1990
13 years 9 months ago
Some Applications of Graph Bandwidth to Constraint Satisfaction Problems
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...
Ramin Zabih
ISMIS
2003
Springer
14 years 1 months ago
Development of Generic Search Method Based on Transformation Invariance
Abstract. The needs of efficient and flexible information retrieval on multistructural data stored in database and network are significantly growing. Especially, its flexibility pl...
Fuminori Adachi, Takashi Washio, Hiroshi Motoda, A...
ECCV
2008
Springer
14 years 9 months ago
Face Alignment Via Component-Based Discriminative Search
In this paper, we propose a component-based discriminative approach for face alignment without requiring initialization1 . Unlike many approaches which locally optimize in a small ...
Lin Liang, Rong Xiao, Fang Wen, Jian Sun
ANTSW
2010
Springer
13 years 5 months ago
A Cooperative Network Game Efficiently Solved via an Ant Colony Optimization Approach
Abstract. In this paper, a Cooperative Network Game (CNG) is introduced. In this game, all players have the same goal: display a video content in real time, with no cuts and low bu...
Pablo Romero, Franco Robledo, Pablo Rodrígu...
IJSNET
2006
110views more  IJSNET 2006»
13 years 7 months ago
Improving network lifetime using sensors with adjustable sensing ranges
Abstract: This paper addresses the target coverage problem in wireless sensor networks with adjustable sensing range. Communication and sensing consume energy, therefore efficient ...
Mihaela Cardei, Jie Wu, Mingming Lu