Search results for "worst-case computational complexity"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
2	Gerald M. Karam, Raymond J. A. Buhr	Temporal Logic-Based Deadlock Analysis For Ada.	IEEE Trans. Software Eng.	1991	DBLP DOI BibTeX RDF	temporal logic-based specification language, deadlock analyzer, Timebench, concurrent system-design environment, COL, linear-time temporal logic, formal basis, axiomatic reasoning, deadlock analysis tool, reasoning power, Ada designs, systemwide deadlock-free, deadlock algorithm, finite systems, worst-case computational complexity, gas station, layered communications system, computational complexity, Ada, logic programming, temporal logic, Prolog, specification language, specification languages, inference mechanisms, system recovery, theorem prover, readers, dining philosophers, writers
1	Jacob Burnim, Sudeep Juvekar, Koushik Sen	WISE: Automated test generation for worst-case complexity.	ICSE	2009	DBLP DOI BibTeX RDF
1	Yongmei Dai, Zhiyuan Yan	A modified MMSE-SD soft detector for coded MIMO-OFDM systems.	ISCAS	2008	DBLP DOI BibTeX RDF
1	Yongmei Dai, Zhiyuan Yan	Efficient ordering schemes for sphere decoder.	SiPS	2008	DBLP DOI BibTeX RDF
1	A. P. Yogananda, M. Narasimha Murty, Lakshmi Gopal	A fast linear separability test by projection of positive points on subspaces.	ICML	2007	DBLP DOI BibTeX RDF
1	Paolo Valente	Exact GPS simulation and optimal fair scheduling with logarithmic complexity.	IEEE/ACM Trans. Netw.	2007	DBLP DOI BibTeX RDF	scheduling, complexity theory, tree data structures
1	Yuguo He	An Efficient Attribute Reduction Algorithm.	IDEAL	2006	DBLP DOI BibTeX RDF
1	Marta M. B. Pascoal, M. Eugénia V. Captivo, João C. N. Clímaco	A note on a new variant of Murty's ranking assignments algorithm.	4OR	2003	DBLP DOI BibTeX RDF	Graph theory, mathematical programming, combinatorics
1	Jinggang Wang, Binoy Ravindran	BPA: A Fast Packet Scheduling Algorithm for Real-Time Switched Ethernet Networks. (PDF / PS)	ICPP	2002	DBLP DOI BibTeX RDF
1	Héctor Cancela, María E. Urquhart	Adapting RVR Simulation Techniques for Residual Connectedness Network.	IEEE Trans. Computers	2002	DBLP DOI BibTeX RDF	residual connectedness network reliability, recursive variance reduction, simulation, Monte Carlo methods
1	Turgay Korkmaz, Marwan Krunz, Spyros Tragoudas	An efficient algorithm for finding a path subject to two additive constraints.	SIGMETRICS	2000	DBLP DOI BibTeX RDF	multiple constrained path selection, QoS routing, scalable routing
1	Éric Grégoire	Handling Inconsistency Efficiently in the Incremental Construction of Statified Belief Bases.	ESCQARU	1999	DBLP DOI BibTeX RDF
1	Raffaele Cerulli, P. Festa, G. Raiconi, G. Visciano	The Auction Technique for the Sensor Based Navigation Planning of an Autonomous Mobile Robot.	Journal of Intelligent and Robotic Systems	1998	DBLP DOI BibTeX RDF	robot motion, Auction method, shortest path
1	Clark F. Olson	Decomposition of the Hough Transform: Curve Detection with Efficient Error Propagation.	ECCV	1996	DBLP DOI BibTeX RDF
1	Saumya K. Debray	On the Complexity of Dataflow Analysis of Logic Programs.	ACM Trans. Program. Lang. Syst.	1995	DBLP DOI BibTeX RDF	complexity, Prolog, program analysis
1	Georgios Paliouras, David S. Brée	The Effect of Numeric Features on the Scalability of Inductive Learning Programs.	ECML	1995	DBLP DOI BibTeX RDF	empirical concept learning, numeric features, scalability, decision trees
1	Stella N. Batalama, Dimitrios A. Pados, Theodore S. Papatheodorou	A heuristic single-row router minimizing interstreet crossings.	IEEE Trans. on CAD of Integrated Circuits and Systems	1993	DBLP DOI BibTeX RDF
1	Saumya K. Debray	On the Complexity of Dataflow Analysis of Logic Programs.	ICALP	1992	DBLP DOI BibTeX RDF
1	Scott M. Huse	Optimal Path Analysis Using a Predator-Prey Neural Network Model.	IEA/AIE (Vol. 2)	1990	DBLP DOI BibTeX RDF
1	Tak-Kwong Ng, S. Lennart Johnsson	Generation of layouts from MOS circuit schematics: a graph theoretic approach.	DAC	1985	DBLP DOI BibTeX RDF