Sciweavers

1566 search results - page 43 / 314
» Saving Space in a Time Efficient Simulation Algorithm
Sort
View
CP
2005
Springer
14 years 1 months ago
AND/OR Branch-and-Bound for Solving Mixed Integer Linear Programming Problems
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
Radu Marinescu 0002, Rina Dechter
TSMC
2002
110views more  TSMC 2002»
13 years 7 months ago
Complexity reduction for "large image" processing
We present a method for sampling feature vectors in large (e.g., 2000 5000 16 bit) images that finds subsets of pixel locations which represent "regions" in the image. Sa...
Nikhil R. Pal, James C. Bezdek
NIPS
2001
13 years 9 months ago
Efficiency versus Convergence of Boolean Kernels for On-Line Learning Algorithms
The paper studies machine learning problems where each example is described using a set of Boolean features and where hypotheses are represented by linear threshold elements. One ...
Roni Khardon, Dan Roth, Rocco A. Servedio
AINA
2006
IEEE
13 years 11 months ago
Efficient Packet Scheduler For Wireless Ad Hoc Networks With Switched Beam Antennas
Using beam forming antennas in ad hoc networks have been recently focused on, in order to improve the space reuse. This news context implies to revisit network algorithms because t...
Gilles Grimaud, Antoine Honore, Hervé Meuni...
ISSS
2002
IEEE
133views Hardware» more  ISSS 2002»
14 years 19 days ago
Efficient Simulation of Synthesis-Oriented System Level Designs
Modeling for synthesis and modeling for simulation seem to be two competing goals in the context of C++-based modeling frameworks. One of the reasons is while most hardware system...
Rajesh K. Gupta, Sandeep K. Shukla, Nick Savoiu