Search results for "pure"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
23	Gunnar Wilken	Pure patterns of order 2.	Ann. Pure Appl. Log.	2018	DBLP DOI BibTeX RDF
23	Joseph S. Miller, Mariya Ivanova Soskova	Corrigendum to "Advice classes of parameterized tractability" [Ann. Pure Appl. Logic 84 (1) (1997) 119-138].	Ann. Pure Appl. Log.	2018	DBLP DOI BibTeX RDF
23	Vasco Brattka, Andrea Cettolo, Guido Gherardi, Alberto Marcone, Matthias Schröder 0001	Addendum to: "The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma" [Ann. Pure Appl. Logic 163 (6) (2012) 623-655].	Ann. Pure Appl. Log.	2017	DBLP DOI BibTeX RDF
23	S. Barry Cooper, Leo Harrington, Alistair H. Lachlan, Steffen Lempp, Robert I. Soare	Corrigendum to "The d.r.e. degrees are not dense" [Ann. Pure Appl. Logic 55 (1991) 125-151].	Ann. Pure Appl. Log.	2017	DBLP DOI BibTeX RDF
23	Michal Doucha	Erratum to: "Scott rank of Polish metric spaces" [Ann. Pure Appl. Logic 165 (12) (2014) 1919-1929].	Ann. Pure Appl. Log.	2017	DBLP DOI BibTeX RDF
23	Andrew M. W. Glass, Angus Macintyre, Françoise Point	Erratum to "Free abelian lattice-ordered groups" [Ann. Pure Appl. Logic 134 (2-3) (2005) 265-283].	Ann. Pure Appl. Log.	2016	DBLP DOI BibTeX RDF
23	Ciro Russo	Corrigendum to "An order-theoretic analysis of interpretations among propositional deductive systems" [Ann. Pure Appl. Logic 164 (2) (2013) 112-130].	Ann. Pure Appl. Log.	2016	DBLP DOI BibTeX RDF
23	Monica Van Dieren	Erratum to "Categoricity in abstract elementary classes with no maximal models" [Ann. Pure Appl. Logic 141 (2006) 108-147].	Ann. Pure Appl. Log.	2013	DBLP DOI BibTeX RDF
23	Philip Scowcroft	Erratum to "Elimination of unbounded quantifiers for some poly-regular groups of infinite rank" [Ann. Pure Appl. Logic 149 (1-3) (2007) 40-80].	Ann. Pure Appl. Log.	2013	DBLP DOI BibTeX RDF
23	Eduardo J. Dubuc	Erratum to "Representation theory of MV-algebras" [Ann. Pure Appl. Logic 161 (8) (2010)].	Ann. Pure Appl. Log.	2012	DBLP DOI BibTeX RDF
23	Sándor Jenei	Erratum to "On the reflection invariance of residuated chains" [Ann. Pure Appl. Logic 161 (2009) 220-227].	Ann. Pure Appl. Log.	2010	DBLP DOI BibTeX RDF
23	Antonio Di Nola, Anatolij Dvurecenskij, Ada Lettieri	Erratum to "State-morphism MV-algebras" [Ann. Pure Appl. Logic 161 (2009) 161-173].	Ann. Pure Appl. Log.	2010	DBLP DOI BibTeX RDF
23	Vincent Astier	Erratum to: "Some model-theoretic results in the algebraic theory of quadratic forms" [Ann. Pure Appl. Logic 112 (2-3) (2001) 189-223].	Ann. Pure Appl. Log.	2009	DBLP DOI BibTeX RDF
23	Benjamin Wells	Erratum to "Applying, extending, and specializing pseudorecursiveness": [Ann. Pure Appl. Logic 126 (2004) 225-254].	Ann. Pure Appl. Log.	2004	DBLP DOI BibTeX RDF
23	John W. Addison	Tarski's theory of definability: common themes in descriptive set theory, recursive function theory, classical pure logic, and finite-universe logic.	Ann. Pure Appl. Log.	2004	DBLP DOI BibTeX RDF
23	Joseph Y. Halpern, Bruce M. Kapron	Erratum to "Zero-one laws for modal logic" [Ann. Pure Appl. Logic 69 (1994) 157-193].	Ann. Pure Appl. Log.	2003	DBLP DOI BibTeX RDF
23	Jeremy Avigad	Erratum to "Saturated models of universal theories": [Ann. Pure Appl. Logic 118 (2002) 219-234].	Ann. Pure Appl. Log.	2003	DBLP DOI BibTeX RDF
23	Arnold Beckmann, Samuel R. Buss, Chris Pollett	Erratum to "Ordinal notations and well-orderings in bounded arithmetic" [Annals of Pure and Applied Logic 120 (2003) 197-223].	Ann. Pure Appl. Log.	2003	DBLP DOI BibTeX RDF
23	Andreas Blass, Yuri Gurevich, Saharon Shelah	Addendum to "Choiceless Polynomial Time": Ann. Pure Appl. Logic 100 (1999) 141-187.	Ann. Pure Appl. Log.	2001	DBLP DOI BibTeX RDF
23	Lawrence S. Moss	Erratum to "Coalgebraic Logic": Ann. pure appl. logic 96 (1999) 277-317.	Ann. Pure Appl. Log.	1999	DBLP DOI BibTeX RDF
23	Hans Tonino, Ken-etsu Fujita	On the Adequacy of Representing Higher Order Intuitionistic Logic as a Pure Type System.	Ann. Pure Appl. Log.	1992	DBLP DOI BibTeX RDF
23	Gregory L. Cherlin, Peter H. Schmitt	Locally pure topological abelian groups: elementary invariants.	Ann. Pure Appl. Log.	1983	DBLP DOI BibTeX RDF
23	Mirjam Dür, Charoenchai Khompatraporn, Zelda B. Zabinsky	Solving fractional problems with dynamic multistart improving hit-and-run.	Ann. Oper. Res.	2007	DBLP DOI BibTeX RDF	Improving hit-and-run, Lipschitz properties, Multistart, Pure adaptive search, Global optimization, Stochastic algorithms, Fractional programming
23	Yun Zhang, Min-You Wu, Wei Shu	Adaptive channel allocation for large-scale streaming content delivery systems.	Multim. Tools Appl.	2007	DBLP DOI BibTeX RDF	Pure-rate-control, Multiple-service-class, Modified-multi-service-class, Adaptive algorithm
23	Michel Hébert	l-presentable Morphisms, Injectivity and (Weak) Factorization Systems.	Appl. Categorical Struct.	2006	DBLP DOI BibTeX RDF	finitely presentable morphism, finitely presented morphism, pure morphism, injectivity, locally presentable categories, weak factorization system, orthogonality
23	S. Basu, A. Bhatia	A naive genetic approach for non-stationary constrained problems.	Soft Comput.	2006	DBLP DOI BibTeX RDF	Non-stationary problems, 0/1 Knapsack problem, Pure-integer programming problem, Genetic algorithm, Constrained optimization
23	Daisuke Takemoto, Shigeaki Tagashira, Satoshi Fujita	Distributed Algorithms for Balanced Zone Partitioning in Content-Addressable Networks.	ICPADS	2004	DBLP DOI BibTeX RDF	Pure peer-to-peer systems, Content-Addressable Networks, zone partitioning, load balancing
23	Wuu Yang	A Classification of Noncircular Attribute Grammars Based on the Look-Ahead Behavior.	IEEE Trans. Software Eng.	2002	DBLP DOI BibTeX RDF	noncircular attribute grammars, ordered attribute grammars, pure multivisit attribute grammars, simple multivisit attribute grammars, well-defined attribute grammars, grammar classification, attribute grammars
23	Laura C. Rivero, Jorge Horacio Doorn, Viviana E. Ferraggine	Elicitation and conversion of hidden objects and restrictions in a database schema.	SAC	2002	DBLP DOI BibTeX RDF	database conceptual schema reengineering, denormalization, pure inclusion dependencies
23	Robert F. Stärk	Total Correctness of Logic Programs: A Formal Approach.	ELP	1996	DBLP DOI BibTeX RDF	Formal methods in logic programming, verification of logic programs, pure Prolog, negation as failure
23	H. Wehbi, Hamouche Oulhadj, Jacques Lemoine, Eric Petit 0001	Numeral characters and capital letters segmentation recognition in mixed handwriting context.	ICDAR	1995	DBLP DOI BibTeX RDF	numeral characters segmentation recognition, capital letters segmentation recognition, mixed handwriting context, analytic on-line recognition, overlapping discretely written characters, pure cursive writing, word segmentation problems, word drawings, mixed writing, handwriting recognition
23	Burton S. Kaliski Jr., Ronald L. Rivest, Alan T. Sherman	Is the Data Encryption Standard a Group? (Preliminary Abstract).	EUROCRYPT	1985	DBLP DOI BibTeX RDF	closed cipher, cycle-detection algorithm, finite permutation group, idempotent cryptosystem, pure cipher, cryptanalysis, Data Encryption Standard (DES), multiple encryption, Birthday Paradox
22	Andreas Henrich, Stefanie Sieber	Blended learning and pure e-learning concepts for information retrieval: experiences and future directions.	Inf. Retr.	2009	DBLP DOI BibTeX RDF	Teaching information retrieval, Interaction, e-Learning, Blended learning
22	Samee Ullah Khan, Ishfaq Ahmad	A Pure Nash Equilibrium-Based Game Theoretical Method for Data Replication across Multiple Servers.	IEEE Trans. Knowl. Data Eng.	2009	DBLP DOI BibTeX RDF
22	Ge Nong, Sen Zhang, Wai Hong Chan	Linear Suffix Array Construction by Almost Pure Induced-Sorting.	DCC	2009	DBLP DOI BibTeX RDF
22	Paolo Tranquilli	Confluence of Pure Differential Nets with Promotion.	CSL	2009	DBLP DOI BibTeX RDF
22	Kim Thang Nguyen	-Hardness of Pure Nash Equilibrium in Scheduling and Connection Games.	SOFSEM	2009	DBLP DOI BibTeX RDF	Nash equilibrium, hardness
22	Shuzhi Sam Ge, Chenguang Yang, Tong Heng Lee	Adaptive Predictive Control Using Neural Network for a Class of Pure-Feedback Systems in Discrete Time.	IEEE Trans. Neural Networks	2008	DBLP DOI BibTeX RDF
22	Satoshi Ohzahata, Konosuke Kawashima	A Study on Traffic Characteristics Evaluation for a Pure P2P Application.	PDP	2008	DBLP DOI BibTeX RDF	measurement, P2P, traffic
22	Nathan Mishra-Linger, Tim Sheard	Erasure and Polymorphism in Pure Type Systems.	FoSSaCS	2008	DBLP DOI BibTeX RDF
22	Beibei Ren, Shuzhi Sam Ge, Tong Heng Lee, Chun-Yi Su	Adaptive neural control for uncertain nonlinear systems in pure-feedback form with hysteresis input.	CDC	2008	DBLP DOI BibTeX RDF
22	Thomas Dueholm Hansen, Orestis Telelis	On Pure and (Approximate) Strong Equilibria of Facility Location Games.	WINE	2008	DBLP DOI BibTeX RDF
22	Felix Brandt 0001, Felix A. Fischer, Markus Holzer 0001	Symmetries and the Complexity of Pure Nash Equilibrium.	STACS	2007	DBLP DOI BibTeX RDF
22	Manfred Kunde	A New Bound for Pure Greedy Hot Potato Routing.	STACS	2007	DBLP DOI BibTeX RDF
22	Radu Marinescu 0002, Rina Dechter	AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems.	CPAIOR	2006	DBLP DOI BibTeX RDF
22	C. Barry Jay, Delia Kesner	Pure Pattern Calculus.	ESOP	2006	DBLP DOI BibTeX RDF
22	Shankara Narayanan Krishna	On Pure Catalytic P Systems.	UC	2006	DBLP DOI BibTeX RDF
22	Constantinos Daskalakis, Christos H. Papadimitriou	Computing pure nash equilibria in graphical games via markov random fields.	EC	2006	DBLP DOI BibTeX RDF	markov random fields, nash equilibrium, treewidth
22	Satoshi Ohzahata, Yoichi Hagiwara, Matsuaki Terada, Konosuke Kawashima	A Traffic Identification Method and Evaluations for a Pure P2P Application.	PAM	2005	DBLP DOI BibTeX RDF
22	Carme Àlvarez, Joaquim Gabarró, Maria J. Serna	Pure Nash Equilibria in Games with a Large Number of Actions.	MFCS	2005	DBLP DOI BibTeX RDF	Nash equilibria, complexity classes, Strategic games
22	Kalle Saari	On the Frequency of Letters in Pure Binary Morphic Sequences.	Developments in Language Theory	2005	DBLP DOI BibTeX RDF
22	Ashish Sureka, Peter R. Wurman	Using tabu best-response search to find pure strategy nash equilibria in normal form games.	AAMAS	2005	DBLP DOI BibTeX RDF	algorithms for computing nash equilibria, multi-agent systems, game theory, tabu search
22	Lei Wang, Sing Bing Kang, Heung-Yeung Shum, Guangyou Xu	Error Analysis of Pure Rotation-Based Self-Calibration.	IEEE Trans. Pattern Anal. Mach. Intell.	2004	DBLP DOI BibTeX RDF	rotating cameras, error analysis, Self-calibration
22	Nikolaos Drosinos, Nectarios Koziris	Performance Comparison of Pure MPI vs Hybrid MPI-OpenMP Parallelization Models on SMP Clusters.	IPDPS	2004	DBLP DOI BibTeX RDF
22	Yi Ren, Chaofeng Sha, Weining Qian, Aoying Zhou, Beng Chin Ooi, Kian-Lee Tan	Explore the "Small World Phenomena" in Pure P2P Information Sharing Systems.	CCGRID	2003	DBLP DOI BibTeX RDF
22	Andrea Maniero, Andrea Gerosa, Andrea Neviani	Performance optimization in micro-power, low-voltage log-domain filters in pure CMOS technology.	ISCAS (1)	2003	DBLP DOI BibTeX RDF
22	In-suk Kim, Yong-hyeog Kang, Young Ik Eom	An Efficient Contents Discovery Mechanism in Pure P2P Environments.	GCC (1)	2003	DBLP DOI BibTeX RDF
22	Sanjeev Baskiyar	Efficient Execution of Pure Object-Oriented Programs by Follow-up Compilation.	Computing	2002	DBLP DOI BibTeX RDF	AMS Subject Classifications: 68N20, 68N19, 68N15, 68N25
22	Kazunori Ueda	A Pure Meta-interpreter for Flat GHC, a Concurrent Constraint Language.	Computational Logic: Logic Programming and Beyond	2002	DBLP DOI BibTeX RDF
22	A. Abella, Vasilis Friderikos, Hamid Aghvami	Differentiated services versus over-provisioned best-effort for pure-IP mobile networks.	MWCN	2002	DBLP DOI BibTeX RDF
22	Manuel Bodirsky, Martin Kutz	Pure Dominance Constraints.	STACS	2002	DBLP DOI BibTeX RDF	tree descriptions, constraint satisfaction, Efficient algorithms
22	Weiqin Tong, Rui Meng, Jingyi Dong	Experiences in Pure Java Implementation of Parallel Libraries.	ICOIN	2001	DBLP DOI BibTeX RDF
22	Kento Aida, Hironori Kasahara, Seinosuke Narita	Job Scheduling Scheme for Pure Space Sharing Among Rigid Jobs.	JSSPP	1998	DBLP DOI BibTeX RDF
22	Edward Cherlin	Pure Functions in APL and J.	APL	1991	DBLP DOI BibTeX RDF	APL
21	Krishnendu Chatterjee, Thomas A. Henzinger, Vinayak S. Prabhu	Trading Infinite Memory for Uniform Randomness in Timed Games.	HSCC	2008	DBLP DOI BibTeX RDF
21	Tian-Ming Bu, Xiaotie Deng, Qi Qi 0003	Multi-bidding Strategy in Sponsored Keyword Auction.	FAW	2008	DBLP DOI BibTeX RDF
21	Martin Gairing	Malicious Bayesian Congestion Games.	WAOA	2008	DBLP DOI BibTeX RDF
21	Lars Birkedal, Søren Debois, Thomas T. Hildebrandt	On the Construction of Sorted Reactive Systems.	CONCUR	2008	DBLP DOI BibTeX RDF
21	Marios Mavronicolas, Burkhard Monien, Klaus W. Wagner	Weighted Boolean Formula Games.	WINE	2007	DBLP DOI BibTeX RDF
21	Pengpeng Wang, Kamal Gupta 0001	A Configuration Space View of View Planning.	IROS	2006	DBLP DOI BibTeX RDF
21	Ran Raz, Amir Shpilka	Deterministic polynomial identity testing in non-commutative models.	Comput. Complex.	2005	DBLP DOI BibTeX RDF	68Q25, Subject classification
21	Changsheng Xu, Namunu Chinthaka Maddage, Xi Shao	Automatic music classification and summarization.	IEEE Trans. Speech Audio Process.	2005	DBLP DOI BibTeX RDF
21	Vincent Conitzer, Tuomas Sandholm	Complexity of (iterated) dominance.	EC	2005	DBLP DOI BibTeX RDF	(iterated) dominance, game theory
21	Benjamin Melamed, Shuo Pan, Yorai Wardi	HNS: A streamlined hybrid network simulator.	ACM Trans. Model. Comput. Simul.	2004	DBLP DOI BibTeX RDF	fluid TCP simulation, fluid-flow simulation, mixed models, packet models, streamlining, hybrid simulation, Fluid-flow models
21	Ester Ciancamerla, Michele Minichino	Performability Measures of the Public Mobile Network of a Tele Control System.	SAFECOMP	2004	DBLP DOI BibTeX RDF
21	Iain Phillips 0001, Maria Grazia Vigliotti	Electoral Systems in Ambient Calculi.	FoSSaCS	2004	DBLP DOI BibTeX RDF
21	Goetz Graefe, Michael J. Zwilling	Transaction support for indexed views.	SIGMOD Conference	2004	DBLP DOI BibTeX RDF
21	Ran Raz, Amir Shpilka	Deterministic Polynomial Identity Testing in Non-Commutative Models.	CCC	2004	DBLP DOI BibTeX RDF
21	Yasuhito Mukouchi, Ikuyo Yamaue, Masako Sato	Inferring a Rewriting System from Examples.	Discovery Science	1998	DBLP DOI BibTeX RDF
21	Markos Zaharioudakis, Michael J. Carey 0001, Michael J. Franklin	Adaptive, Fine-Grained Sharing in a Client-Server OODBMS: A Callback-Based Approach.	ACM Trans. Database Syst.	1997	DBLP DOI BibTeX RDF	fine-grained sharing, performance analysis, object-oriented databases, cache coherency, cache consistency, client-server databased
21	Farhad Arbab, C. L. Blom, F. J. Burger, C. T. H. Everaars	Reusable Coordinator Modules for Massively Concurrent Applications.	Euro-Par, Vol. I	1996	DBLP DOI BibTeX RDF
21	Ole Rasmussen	An Embedding of Ruby in Isabelle.	CADE	1996	DBLP DOI BibTeX RDF
21	Michael J. Carey 0001, Michael J. Franklin, Markos Zaharioudakis	Fine-Grained Sharing in a Page Server OODBMS.	SIGMOD Conference	1994	DBLP DOI BibTeX RDF
21	Barbara Mirel	Usability and hardcopy manuals: evaluating research designs and methods.	SIGDOC	1990	DBLP DOI BibTeX RDF
21	Frank Pfenning, Peter Lee 0001	LEAP: A Language with Eval And Polymorphism.	TAPSOFT, Vol.2	1989	DBLP DOI BibTeX RDF
18	Jan Jerabek, Kamil Vrba	Novel Universal Filter Using Only Two Current Active Elements.	ICONS	2008	DBLP DOI BibTeX RDF	current follower, MCMI, pure current mode, universal filter, frequency filter
18	Stefan Szeider	Backdoor Sets for DLL Subsolvers.	J. Autom. Reason.	2005	DBLP DOI BibTeX RDF	unit propagation, pure literal elimination, backdoor sets, W[P]-completeness, satisfiability, parameterized complexity
18	Bachuki Mesablishvili	Descent Theory for Schemes.	Appl. Categorical Struct.	2004	DBLP DOI BibTeX RDF	quasi-coherent module, indexed category, (effective) descent morphism, pure morphism of schemes, scheme
18	Lisbeth Fajstrup, Martin Raußen, Eric Goubault, Emmanuel Haucourt	Components of the Fundamental Category.	Appl. Categorical Struct.	2004	DBLP DOI BibTeX RDF	po-space, dihomotopy, fundamental category, category of fractions, invertible morphism, lr-system, pure system, weakly invertible morphism, component
18	George Janelidze, Walter Tholen	Facets of Descent III: Monadic Descent for Rings and Algebras.	Appl. Categorical Struct.	2004	DBLP DOI BibTeX RDF	monadic functor, action of a monoidal category, pure monomorphism, effective descent morphism
18	Henry J. Borron	Upscaling the CLOS Inheritance Mechanism for Multidimensional Objects.	TOOLS (25)	1997	DBLP DOI BibTeX RDF	multidimensional objects, qualifier, standard method combination. monotonicity, pure declarativeness, invocation sequence diagram, regularity condition, prevalence rule, stability, efficiency, role, linearization, combination, congruency, multiple inheritance, multiple dispatch
18	Stephen H. Unger	Hazards, Critical Races, and Metastability.	IEEE Trans. Computers	1995	DBLP DOI BibTeX RDF	critical race, dynamic hazards, essential hazards, inertial delays, pure delays, sequential logic, timing problems, delays, Asynchronous, metastability, timing simulation
18	Chuang Lin 0002, Abhijit Chaudhury, Andrew B. Whinston, Dan C. Marinescu	Logical Inference of Horn Clauses in Petri Net Models.	IEEE Trans. Knowl. Data Eng.	1993	DBLP DOI BibTeX RDF	net model, logical inconsistency check, T-invariants, one-literal, pure-literal, splitting clauses, Petri nets, inference mechanisms, resolution, propositional logic, Horn clauses, Horn clauses, Petri net models, first-order predicate logic, logical inference
18	Jerzy Marcinkowski, Leszek Pacholski	Undecidability of the Horn-Clause Implication Problem	FOCS	1992	DBLP DOI BibTeX RDF	derivation trees, Horn-clause implication, atomic formulas, decidability problems, pure predicate logic, equality symbol
18	Corrado Böhm, Adolfo Piperno	Surjectivity for Finite Sets of Combinators by Weak Reduction.	CSL	1987	DBLP DOI BibTeX RDF	Pure -calculus, combinatory algebras, surjectivity, discriminability or X-separability in -()-calculus
17	Christopher Thomas Ryan, Albert Xin Jiang, Kevin Leyton-Brown	Computing pure strategy nash equilibria in compact symmetric games.	EC	2010	DBLP DOI BibTeX RDF	rational generating functions, symmetric games, game theory
17	Alan R. Prince	Pure partial planes of order 6 with 25 lines.	Des. Codes Cryptogr.	2009	DBLP DOI BibTeX RDF	Mathematics Subject Classifications (2000) 05B15, 51E30, 05B25
17	Wenqi Huang, Kun He 0001	A pure quasi-human algorithm for solving the cuboid packing problem.	Sci. China Ser. F Inf. Sci.	2009	DBLP DOI BibTeX RDF	quasi-human approach, caving degree, heuristic, NP-hard, packing problem
17	Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Yuri Pirola, Romeo Rizzi	Pure Parsimony Xor Haplotyping.	ISBRA	2009	DBLP DOI BibTeX RDF
17	K. Rustan M. Leino, Ronald Middelkoop	Proving Consistency of Pure Methods and Model Fields.	FASE	2009	DBLP DOI BibTeX RDF