Sciweavers

3250 search results - page 311 / 650
» Parameterized Learning Complexity
Sort
View
ICTAI
2010
IEEE
15 years 4 months ago
Combining Mixed Integer Programming and Supervised Learning for Fast Re-planning
We introduce a new plan repair method for problems cast as Mixed Integer Programs. In order to tackle the inherent complexity of these NP-hard problems, our approach relies on the ...
Emmanuel Rachelson, Ala Ben Abbes, Sebastien Dieme...
IJACTAICIT
2010
163views more  IJACTAICIT 2010»
15 years 4 months ago
Modified Vector Field Histogram with a Neural Network Learning Model for Mobile Robot Path Planning and Obstacle Avoidance
In this work, a Modified Vector Field Histogram (MVFH) has been developed to improve path planning and obstacle avoidance for a wheeled driven mobile robot. It permits the detecti...
Bahaa I. Kazem, Ali H. Hamad, Mustafa M. Mozael
TCAD
2010
102views more  TCAD 2010»
15 years 1 months ago
Functional Test Generation Using Efficient Property Clustering and Learning Techniques
Abstract--Functional verification is one of the major bottlenecks in system-on-chip design due to the combined effects of increasing complexity and lack of automated techniques for...
Mingsong Chen, Prabhat Mishra
TNN
2010
176views Management» more  TNN 2010»
15 years 1 months ago
Sparse approximation through boosting for learning large scale kernel machines
Abstract--Recently, sparse approximation has become a preferred method for learning large scale kernel machines. This technique attempts to represent the solution with only a subse...
Ping Sun, Xin Yao
TON
2010
126views more  TON 2010»
15 years 1 months ago
MAC Scheduling With Low Overheads by Learning Neighborhood Contention Patterns
Aggregate traffic loads and topology in multi-hop wireless networks may vary slowly, permitting MAC protocols to `learn' how to spatially coordinate and adapt contention patte...
Yung Yi, Gustavo de Veciana, Sanjay Shakkottai